/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_sea.ch.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:55,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:55,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:55,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:55,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:55,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:55,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:55,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:55,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:55,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:55,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:55,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:55,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:55,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:55,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:55,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:55,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:55,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:55,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:55,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:55,606 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:55,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:55,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:55,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:55,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:55,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:55,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:55,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:55,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:55,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:55,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:55,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:55,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:55,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:55,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:55,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:55,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:55,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:55,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:55,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:55,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:55,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:55,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:16:55,644 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:16:55,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:16:55,645 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:16:55,645 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:16:55,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:16:55,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:16:55,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:16:55,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:16:55,647 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:16:55,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:16:55,647 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:16:55,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:16:55,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:16:55,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:16:55,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:16:55,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:16:55,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:16:55,648 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:16:55,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:16:55,648 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:16:55,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:16:55,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:16:55,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:16:55,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:16:55,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:55,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:16:55,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:16:55,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:16:55,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:16:55,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:16:55,650 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:16:55,650 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:16:55,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:16:55,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:16:55,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:16:55,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:16:55,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:16:55,852 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:16:55,852 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:16:55,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_sea.ch.c [2022-04-27 10:16:55,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f2365e7/59b3caebd211450f9f6230c6fcedef2c/FLAGd86a0b3cd [2022-04-27 10:16:56,221 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:16:56,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c [2022-04-27 10:16:56,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f2365e7/59b3caebd211450f9f6230c6fcedef2c/FLAGd86a0b3cd [2022-04-27 10:16:56,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f2365e7/59b3caebd211450f9f6230c6fcedef2c [2022-04-27 10:16:56,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:16:56,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:16:56,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:56,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:16:56,674 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:16:56,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d4341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56, skipping insertion in model container [2022-04-27 10:16:56,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:16:56,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:16:56,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c[383,396] [2022-04-27 10:16:56,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:56,825 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:16:56,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c[383,396] [2022-04-27 10:16:56,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:56,846 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:16:56,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56 WrapperNode [2022-04-27 10:16:56,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:56,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:16:56,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:16:56,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:16:56,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:16:56,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:16:56,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:16:56,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:16:56,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (1/1) ... [2022-04-27 10:16:56,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:56,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:56,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:16:56,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:16:56,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:16:56,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:16:56,916 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:16:56,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:16:56,916 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-27 10:16:56,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:16:56,916 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 10:16:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:16:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:16:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:16:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:16:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 10:16:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:16:56,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:16:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-27 10:16:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:16:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:16:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 10:16:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 10:16:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:16:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:16:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:16:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:16:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:16:56,964 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:16:56,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:16:57,107 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:16:57,112 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:16:57,112 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:16:57,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:57 BoogieIcfgContainer [2022-04-27 10:16:57,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:16:57,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:16:57,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:16:57,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:16:57,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:16:56" (1/3) ... [2022-04-27 10:16:57,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446a2fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:57, skipping insertion in model container [2022-04-27 10:16:57,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:56" (2/3) ... [2022-04-27 10:16:57,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446a2fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:57, skipping insertion in model container [2022-04-27 10:16:57,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:57" (3/3) ... [2022-04-27 10:16:57,120 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.c [2022-04-27 10:16:57,129 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:16:57,130 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:16:57,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:16:57,166 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@9afcaa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31ff3b74 [2022-04-27 10:16:57,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:16:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:16:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 10:16:57,178 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:57,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:57,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:57,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:57,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1307815669, now seen corresponding path program 1 times [2022-04-27 10:16:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:57,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90685474] [2022-04-27 10:16:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {36#true} is VALID [2022-04-27 10:16:57,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 10:16:57,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #66#return; {36#true} is VALID [2022-04-27 10:16:57,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:16:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {36#true} is VALID [2022-04-27 10:16:57,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 10:16:57,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #60#return; {36#true} is VALID [2022-04-27 10:16:57,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:16:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:57,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {36#true} is VALID [2022-04-27 10:16:57,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-04-27 10:16:57,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {37#false} is VALID [2022-04-27 10:16:57,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 10:16:57,493 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37#false} {36#true} #62#return; {37#false} is VALID [2022-04-27 10:16:57,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:57,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {36#true} is VALID [2022-04-27 10:16:57,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 10:16:57,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #66#return; {36#true} is VALID [2022-04-27 10:16:57,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret10 := main(); {36#true} is VALID [2022-04-27 10:16:57,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {36#true} is VALID [2022-04-27 10:16:57,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {36#true} is VALID [2022-04-27 10:16:57,498 INFO L272 TraceCheckUtils]: 7: Hoare triple {36#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {50#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 10:16:57,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {36#true} is VALID [2022-04-27 10:16:57,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 10:16:57,498 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#true} {36#true} #60#return; {36#true} is VALID [2022-04-27 10:16:57,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {36#true} is VALID [2022-04-27 10:16:57,499 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {36#true} is VALID [2022-04-27 10:16:57,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {36#true} is VALID [2022-04-27 10:16:57,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-04-27 10:16:57,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {37#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {37#false} is VALID [2022-04-27 10:16:57,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 10:16:57,501 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37#false} {36#true} #62#return; {37#false} is VALID [2022-04-27 10:16:57,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {37#false} is VALID [2022-04-27 10:16:57,502 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert(#t~ret9); {37#false} is VALID [2022-04-27 10:16:57,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-27 10:16:57,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-27 10:16:57,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-27 10:16:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:57,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:57,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90685474] [2022-04-27 10:16:57,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90685474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:57,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:57,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:16:57,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15514975] [2022-04-27 10:16:57,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:57,513 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:16:57,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:57,517 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:16:57,549 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:16:57,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:16:57,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:16:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:16:57,575 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 10:16:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,812 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-27 10:16:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:16:57,813 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:16:57,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:57,814 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:16:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-27 10:16:57,825 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:16:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-27 10:16:57,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-27 10:16:57,890 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:16:57,897 INFO L225 Difference]: With dead ends: 51 [2022-04-27 10:16:57,898 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 10:16:57,900 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:16:57,904 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:57,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 10:16:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 10:16:57,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:57,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:57,934 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:57,935 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,941 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 10:16:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 10:16:57,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:57,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:57,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 10:16:57,942 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 10:16:57,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:57,945 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-27 10:16:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 10:16:57,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:57,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:57,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:57,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-27 10:16:57,950 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-04-27 10:16:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:57,951 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-27 10:16:57,951 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:16:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-27 10:16:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:16:57,952 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:57,952 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:16:57,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:16:57,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:57,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:57,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1795654780, now seen corresponding path program 1 times [2022-04-27 10:16:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:57,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424941770] [2022-04-27 10:16:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {227#(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; {209#true} is VALID [2022-04-27 10:16:58,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} assume true; {209#true} is VALID [2022-04-27 10:16:58,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {209#true} {209#true} #66#return; {209#true} is VALID [2022-04-27 10:16:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:16:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {209#true} is VALID [2022-04-27 10:16:58,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} assume true; {209#true} is VALID [2022-04-27 10:16:58,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {209#true} {209#true} #60#return; {209#true} is VALID [2022-04-27 10:16:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:16:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {209#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {209#true} is VALID [2022-04-27 10:16:58,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {209#true} is VALID [2022-04-27 10:16:58,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#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; {209#true} is VALID [2022-04-27 10:16:58,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {209#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {209#true} is VALID [2022-04-27 10:16:58,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {209#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-27 10:16:58,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-27 10:16:58,188 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {209#true} #62#return; {224#(= |main_#t~ret9| 1)} is VALID [2022-04-27 10:16:58,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {209#true} call ULTIMATE.init(); {227#(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:16:58,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#(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; {209#true} is VALID [2022-04-27 10:16:58,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#true} assume true; {209#true} is VALID [2022-04-27 10:16:58,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {209#true} {209#true} #66#return; {209#true} is VALID [2022-04-27 10:16:58,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {209#true} call #t~ret10 := main(); {209#true} is VALID [2022-04-27 10:16:58,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {209#true} is VALID [2022-04-27 10:16:58,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {209#true} is VALID [2022-04-27 10:16:58,194 INFO L272 TraceCheckUtils]: 7: Hoare triple {209#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {228#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 10:16:58,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {228#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {209#true} is VALID [2022-04-27 10:16:58,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {209#true} assume true; {209#true} is VALID [2022-04-27 10:16:58,195 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {209#true} {209#true} #60#return; {209#true} is VALID [2022-04-27 10:16:58,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#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); {209#true} is VALID [2022-04-27 10:16:58,196 INFO L272 TraceCheckUtils]: 12: Hoare triple {209#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); {209#true} is VALID [2022-04-27 10:16:58,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {209#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {209#true} is VALID [2022-04-27 10:16:58,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {209#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {209#true} is VALID [2022-04-27 10:16:58,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {209#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; {209#true} is VALID [2022-04-27 10:16:58,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {209#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {209#true} is VALID [2022-04-27 10:16:58,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {209#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-27 10:16:58,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-27 10:16:58,200 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {209#true} #62#return; {224#(= |main_#t~ret9| 1)} is VALID [2022-04-27 10:16:58,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#(= |main_#t~ret9| 1)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {224#(= |main_#t~ret9| 1)} is VALID [2022-04-27 10:16:58,201 INFO L272 TraceCheckUtils]: 21: Hoare triple {224#(= |main_#t~ret9| 1)} call __VERIFIER_assert(#t~ret9); {225#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 10:16:58,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {225#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {226#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 10:16:58,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {226#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {210#false} is VALID [2022-04-27 10:16:58,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {210#false} assume !false; {210#false} is VALID [2022-04-27 10:16:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:58,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:58,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424941770] [2022-04-27 10:16:58,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424941770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:58,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:58,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:16:58,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214764477] [2022-04-27 10:16:58,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:58,208 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:16:58,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:58,208 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:16:58,229 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:16:58,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:16:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:58,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:16:58,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:16:58,232 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 10:16:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,558 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-27 10:16:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:16:58,558 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:16:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:58,559 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:16:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-27 10:16:58,560 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:16:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-27 10:16:58,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-27 10:16:58,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:58,606 INFO L225 Difference]: With dead ends: 34 [2022-04-27 10:16:58,606 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 10:16:58,606 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:16:58,607 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:58,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 45 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 10:16:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-27 10:16:58,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:58,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:58,611 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:58,611 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,612 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-27 10:16:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-27 10:16:58,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:58,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 10:16:58,613 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-27 10:16:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:58,614 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-27 10:16:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-27 10:16:58,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:58,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:58,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:58,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:16:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-27 10:16:58,616 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2022-04-27 10:16:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:58,616 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-27 10:16:58,617 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:16:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-27 10:16:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 10:16:58,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:58,617 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:16:58,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:16:58,618 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -52844445, now seen corresponding path program 1 times [2022-04-27 10:16:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:58,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403370328] [2022-04-27 10:16:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(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; {377#true} is VALID [2022-04-27 10:16:58,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-27 10:16:58,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {377#true} {377#true} #66#return; {377#true} is VALID [2022-04-27 10:16:58,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:16:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {377#true} is VALID [2022-04-27 10:16:58,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-27 10:16:58,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {377#true} {382#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #60#return; {382#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:16:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:16:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:58,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:16:58,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {396#(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:16:58,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {396#(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; {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:16:58,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:16:58,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {397#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:16:58,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {397#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:16:58,798 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {397#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {382#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #62#return; {378#false} is VALID [2022-04-27 10:16:58,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {393#(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:16:58,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(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; {377#true} is VALID [2022-04-27 10:16:58,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-27 10:16:58,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #66#return; {377#true} is VALID [2022-04-27 10:16:58,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret10 := main(); {377#true} is VALID [2022-04-27 10:16:58,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {377#true} is VALID [2022-04-27 10:16:58,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {382#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:16:58,801 INFO L272 TraceCheckUtils]: 7: Hoare triple {382#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {394#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 10:16:58,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {394#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {377#true} is VALID [2022-04-27 10:16:58,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-27 10:16:58,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#true} {382#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #60#return; {382#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:16:58,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {382#(<= (+ 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); {382#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:16:58,802 INFO L272 TraceCheckUtils]: 12: Hoare triple {382#(<= (+ 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); {377#true} is VALID [2022-04-27 10:16:58,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:16:58,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {396#(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:16:58,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {396#(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; {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:16:58,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:16:58,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {395#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {397#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:16:58,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {397#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {397#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-27 10:16:58,807 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {397#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {382#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #62#return; {378#false} is VALID [2022-04-27 10:16:58,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {378#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {378#false} is VALID [2022-04-27 10:16:58,807 INFO L272 TraceCheckUtils]: 21: Hoare triple {378#false} call __VERIFIER_assert(#t~ret9); {378#false} is VALID [2022-04-27 10:16:58,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {378#false} ~cond := #in~cond; {378#false} is VALID [2022-04-27 10:16:58,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {378#false} assume 0 == ~cond; {378#false} is VALID [2022-04-27 10:16:58,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-04-27 10:16:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:58,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:58,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403370328] [2022-04-27 10:16:58,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403370328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:58,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:58,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:16:58,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647911254] [2022-04-27 10:16:58,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:58,809 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:16:58,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:58,809 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:16:58,828 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:16:58,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:16:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:58,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:16:58,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:16:58,829 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:17:03,284 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:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,810 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-27 10:17:03,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:17:03,810 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:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:03,810 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:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2022-04-27 10:17:03,812 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:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2022-04-27 10:17:03,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2022-04-27 10:17:03,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:03,861 INFO L225 Difference]: With dead ends: 39 [2022-04-27 10:17:03,861 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 10:17:03,861 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:03,862 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 59 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:03,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 36 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 10:17:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 10:17:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-27 10:17:03,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:03,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:03,874 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:03,874 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,875 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-27 10:17:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-27 10:17:03,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:03,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:03,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-27 10:17:03,876 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-27 10:17:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,877 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-27 10:17:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-27 10:17:03,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:03,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:03,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:03,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:17:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-27 10:17:03,879 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-27 10:17:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:03,879 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-27 10:17:03,879 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:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-27 10:17:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 10:17:03,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:03,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:03,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:17:03,880 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:03,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:03,880 INFO L85 PathProgramCache]: Analyzing trace with hash -238208460, now seen corresponding path program 1 times [2022-04-27 10:17:03,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:03,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577770246] [2022-04-27 10:17:03,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:03,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {590#(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; {571#true} is VALID [2022-04-27 10:17:03,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-27 10:17:03,986 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {571#true} {571#true} #66#return; {571#true} is VALID [2022-04-27 10:17:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:17:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {591#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {571#true} is VALID [2022-04-27 10:17:04,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-27 10:17:04,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {571#true} {576#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #60#return; {576#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:04,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 10:17:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {571#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {592#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:17:04,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {592#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {593#(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:04,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#(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; {593#(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:04,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {593#(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; {594#(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:04,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {594#(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; {595#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} is VALID [2022-04-27 10:17:04,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {595#(and (<= linear_search_~j~0 1) (or (< 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; {596#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-27 10:17:04,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {596#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {596#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-27 10:17:04,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {597#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:04,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} assume true; {597#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:04,257 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {597#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {576#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #62#return; {572#false} is VALID [2022-04-27 10:17:04,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {571#true} call ULTIMATE.init(); {590#(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,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {590#(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; {571#true} is VALID [2022-04-27 10:17:04,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-27 10:17:04,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {571#true} {571#true} #66#return; {571#true} is VALID [2022-04-27 10:17:04,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {571#true} call #t~ret10 := main(); {571#true} is VALID [2022-04-27 10:17:04,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {571#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {571#true} is VALID [2022-04-27 10:17:04,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {571#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {576#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:04,260 INFO L272 TraceCheckUtils]: 7: Hoare triple {576#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {591#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 10:17:04,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {571#true} is VALID [2022-04-27 10:17:04,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#true} assume true; {571#true} is VALID [2022-04-27 10:17:04,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {571#true} {576#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #60#return; {576#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:04,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(<= (+ 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); {576#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-27 10:17:04,262 INFO L272 TraceCheckUtils]: 12: Hoare triple {576#(<= (+ 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); {571#true} is VALID [2022-04-27 10:17:04,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {571#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {592#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-27 10:17:04,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {593#(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:04,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {593#(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; {593#(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:04,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {593#(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; {594#(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:04,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#(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; {595#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} is VALID [2022-04-27 10:17:04,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (<= linear_search_~j~0 1) (or (< 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; {596#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-27 10:17:04,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {596#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {596#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-27 10:17:04,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {596#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {597#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:04,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {597#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} assume true; {597#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-27 10:17:04,269 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {597#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {576#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #62#return; {572#false} is VALID [2022-04-27 10:17:04,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {572#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {572#false} is VALID [2022-04-27 10:17:04,270 INFO L272 TraceCheckUtils]: 24: Hoare triple {572#false} call __VERIFIER_assert(#t~ret9); {572#false} is VALID [2022-04-27 10:17:04,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {572#false} ~cond := #in~cond; {572#false} is VALID [2022-04-27 10:17:04,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {572#false} assume 0 == ~cond; {572#false} is VALID [2022-04-27 10:17:04,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {572#false} assume !false; {572#false} is VALID [2022-04-27 10:17:04,270 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:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:04,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577770246] [2022-04-27 10:17:04,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577770246] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:04,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126635746] [2022-04-27 10:17:04,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:04,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:04,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:04,272 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:04,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process