/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/linear_sea.ch.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 21:59:26,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 21:59:26,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 21:59:26,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 21:59:26,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 21:59:26,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 21:59:26,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 21:59:26,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 21:59:26,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 21:59:26,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 21:59:26,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 21:59:26,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 21:59:26,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 21:59:26,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 21:59:26,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 21:59:26,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 21:59:26,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 21:59:26,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 21:59:26,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 21:59:26,271 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 21:59:26,273 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 21:59:26,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 21:59:26,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 21:59:26,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 21:59:26,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 21:59:26,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 21:59:26,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 21:59:26,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 21:59:26,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 21:59:26,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 21:59:26,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 21:59:26,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 21:59:26,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 21:59:26,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 21:59:26,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 21:59:26,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 21:59:26,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 21:59:26,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 21:59:26,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 21:59:26,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 21:59:26,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 21:59:26,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 21:59:26,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 21:59:26,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 21:59:26,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 21:59:26,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 21:59:26,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 21:59:26,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 21:59:26,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 21:59:26,310 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 21:59:26,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 21:59:26,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 21:59:26,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 21:59:26,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 21:59:26,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 21:59:26,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 21:59:26,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 21:59:26,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 21:59:26,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 21:59:26,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 21:59:26,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 21:59:26,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 21:59:26,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:59:26,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 21:59:26,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 21:59:26,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 21:59:26,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 21:59:26,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 21:59:26,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 21:59:26,313 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 21:59:26,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 21:59:26,314 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 21:59:26,314 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-07 21:59:26,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 21:59:26,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 21:59:26,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 21:59:26,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 21:59:26,524 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 21:59:26,525 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-07 21:59:26,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c05c6d0a/69e7fa2239224241a4ee64f64587dbcb/FLAG295f4b68a [2022-04-07 21:59:26,905 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 21:59:26,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c [2022-04-07 21:59:26,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c05c6d0a/69e7fa2239224241a4ee64f64587dbcb/FLAG295f4b68a [2022-04-07 21:59:27,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c05c6d0a/69e7fa2239224241a4ee64f64587dbcb [2022-04-07 21:59:27,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 21:59:27,355 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 21:59:27,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 21:59:27,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 21:59:27,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 21:59:27,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435baef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27, skipping insertion in model container [2022-04-07 21:59:27,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 21:59:27,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 21:59:27,523 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-07 21:59:27,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:59:27,560 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 21:59:27,569 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-07 21:59:27,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 21:59:27,584 INFO L208 MainTranslator]: Completed translation [2022-04-07 21:59:27,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27 WrapperNode [2022-04-07 21:59:27,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 21:59:27,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 21:59:27,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 21:59:27,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 21:59:27,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 21:59:27,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 21:59:27,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 21:59:27,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 21:59:27,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 21:59:27,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:59:27,676 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-07 21:59:27,694 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-07 21:59:27,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 21:59:27,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 21:59:27,707 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 21:59:27,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 21:59:27,708 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-07 21:59:27,708 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 21:59:27,708 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-07 21:59:27,708 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 21:59:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 21:59:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 21:59:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 21:59:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-07 21:59:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 21:59:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 21:59:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-07 21:59:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 21:59:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 21:59:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-07 21:59:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-07 21:59:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 21:59:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 21:59:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 21:59:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 21:59:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 21:59:27,783 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 21:59:27,785 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 21:59:27,947 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 21:59:27,951 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 21:59:27,951 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 21:59:27,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:59:27 BoogieIcfgContainer [2022-04-07 21:59:27,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 21:59:27,953 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 21:59:27,953 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 21:59:27,954 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 21:59:27,956 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:59:27" (1/1) ... [2022-04-07 21:59:27,958 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 21:59:27,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:59:27 BasicIcfg [2022-04-07 21:59:27,977 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 21:59:27,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 21:59:27,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 21:59:27,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 21:59:27,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 09:59:27" (1/4) ... [2022-04-07 21:59:27,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3c00cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:59:27, skipping insertion in model container [2022-04-07 21:59:27,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 09:59:27" (2/4) ... [2022-04-07 21:59:27,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3c00cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 09:59:27, skipping insertion in model container [2022-04-07 21:59:27,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 09:59:27" (3/4) ... [2022-04-07 21:59:27,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3c00cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 09:59:27, skipping insertion in model container [2022-04-07 21:59:27,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 09:59:27" (4/4) ... [2022-04-07 21:59:27,983 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.cqvasr [2022-04-07 21:59:27,986 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 21:59:27,987 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 21:59:28,026 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 21:59:28,033 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-07 21:59:28,034 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 21:59:28,050 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-07 21:59:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 21:59:28,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:28,054 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:28,055 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash -679551393, now seen corresponding path program 1 times [2022-04-07 21:59:28,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:28,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166883795] [2022-04-07 21:59:28,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:28,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,325 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|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {36#true} is VALID [2022-04-07 21:59:28,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-07 21:59:28,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-07 21:59:28,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 21:59:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(= |#memory_int| |old(#memory_int)|)} [80] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {36#true} is VALID [2022-04-07 21:59:28,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-07 21:59:28,339 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {36#true} is VALID [2022-04-07 21:59:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 21:59:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} [84] linear_searchENTRY-->L17-5: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {36#true} is VALID [2022-04-07 21:59:28,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} [86] L17-5-->L17-6: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-07 21:59:28,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} [90] L17-6-->linear_searchFINAL: Formula: (and (< (mod v_linear_search_~j~0_5 4294967296) (mod v_~SIZE~0_1 4294967296)) (= |v_linear_search_#res_1| 1)) InVars {~SIZE~0=v_~SIZE~0_1, linear_search_~j~0=v_linear_search_~j~0_5} OutVars{~SIZE~0=v_~SIZE~0_1, linear_search_#res=|v_linear_search_#res_1|, linear_search_~j~0=v_linear_search_~j~0_5} AuxVars[] AssignedVars[linear_search_#res] {37#false} is VALID [2022-04-07 21:59:28,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-07 21:59:28,355 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37#false} {36#true} [105] linear_searchEXIT-->L29-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {37#false} is VALID [2022-04-07 21:59:28,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {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-07 21:59:28,357 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|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {36#true} is VALID [2022-04-07 21:59:28,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-07 21:59:28,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-07 21:59:28,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-07 21:59:28,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} [73] mainENTRY-->L26: Formula: (= v_~SIZE~0_6 (+ (div (mod |v_main_#t~nondet7_2| 4294967296) 8) 1)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_6} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {36#true} is VALID [2022-04-07 21:59:28,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} [75] L26-->L27: Formula: (let ((.cse0 (mod v_~SIZE~0_7 4294967296))) (and (not (= |v_main_#t~malloc8.base_2| 0)) (= |v_main_#t~malloc8.offset_2| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_2| (* .cse0 4)) |v_#length_1|) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_2|) 0) (< .cse0 (mod v_~MAX~0_2 4294967296)) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_2| 1)) (< |v_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|))) InVars {~SIZE~0=v_~SIZE~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_2, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_7, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_2|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_2} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {36#true} is VALID [2022-04-07 21:59:28,361 INFO L272 TraceCheckUtils]: 7: Hoare triple {36#true} [77] L27-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {50#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 21:59:28,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(= |#memory_int| |old(#memory_int)|)} [80] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {36#true} is VALID [2022-04-07 21:59:28,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#true} is VALID [2022-04-07 21:59:28,363 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#true} {36#true} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {36#true} is VALID [2022-04-07 21:59:28,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#true} [79] L27-1-->L29: Formula: (and (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_1|) (= (store |v_#memory_int_3| v_main_~a~0.base_1 (store (select |v_#memory_int_3| v_main_~a~0.base_1) (+ (* 4 (mod (div (mod v_~SIZE~0_3 4294967296) 2) 4294967296)) v_main_~a~0.offset_1) 3)) |v_#memory_int_2|) (= |v_main_#t~malloc8.offset_1| v_main_~a~0.offset_1)) InVars {~SIZE~0=v_~SIZE~0_3, #memory_int=|v_#memory_int_3|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|} OutVars{~SIZE~0=v_~SIZE~0_3, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #memory_int=|v_#memory_int_2|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {36#true} is VALID [2022-04-07 21:59:28,363 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#true} [81] L29-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {36#true} is VALID [2022-04-07 21:59:28,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} [84] linear_searchENTRY-->L17-5: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {36#true} is VALID [2022-04-07 21:59:28,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#true} [86] L17-5-->L17-6: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-07 21:59:28,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {37#false} [90] L17-6-->linear_searchFINAL: Formula: (and (< (mod v_linear_search_~j~0_5 4294967296) (mod v_~SIZE~0_1 4294967296)) (= |v_linear_search_#res_1| 1)) InVars {~SIZE~0=v_~SIZE~0_1, linear_search_~j~0=v_linear_search_~j~0_5} OutVars{~SIZE~0=v_~SIZE~0_1, linear_search_#res=|v_linear_search_#res_1|, linear_search_~j~0=v_linear_search_~j~0_5} AuxVars[] AssignedVars[linear_search_#res] {37#false} is VALID [2022-04-07 21:59:28,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-07 21:59:28,366 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37#false} {36#true} [105] linear_searchEXIT-->L29-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {37#false} is VALID [2022-04-07 21:59:28,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} [83] L29-1-->L29-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-07 21:59:28,367 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} [85] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {37#false} is VALID [2022-04-07 21:59:28,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} [89] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37#false} is VALID [2022-04-07 21:59:28,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} [94] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-07 21:59:28,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} [99] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#false} is VALID [2022-04-07 21:59:28,369 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-07 21:59:28,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:28,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166883795] [2022-04-07 21:59:28,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166883795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:59:28,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:59:28,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 21:59:28,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50194143] [2022-04-07 21:59:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:59:28,378 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-07 21:59:28,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:28,382 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-07 21:59:28,432 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-07 21:59:28,432 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 21:59:28,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:28,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 21:59:28,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 21:59:28,449 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-07 21:59:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,656 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-07 21:59:28,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 21:59:28,656 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-07 21:59:28,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:28,657 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-07 21:59:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-07 21:59:28,663 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-07 21:59:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-07 21:59:28,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-07 21:59:28,736 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-07 21:59:28,746 INFO L225 Difference]: With dead ends: 51 [2022-04-07 21:59:28,746 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 21:59:28,755 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 21:59:28,760 INFO L913 BasicCegarLoop]: 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-07 21:59:28,761 INFO L914 BasicCegarLoop]: 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-07 21:59:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 21:59:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-07 21:59:28,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:28,790 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-07 21:59:28,791 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-07 21:59:28,791 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-07 21:59:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,796 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-07 21:59:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 21:59:28,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:28,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:28,800 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-07 21:59:28,800 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-07 21:59:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:28,806 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-07 21:59:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 21:59:28,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:28,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:28,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:28,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:28,808 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-07 21:59:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-07 21:59:28,812 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-04-07 21:59:28,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:28,813 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-07 21:59:28,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 21:59:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 21:59:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 21:59:28,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:28,815 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:28,815 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 21:59:28,815 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:28,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1069263323, now seen corresponding path program 1 times [2022-04-07 21:59:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:28,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102031422] [2022-04-07 21:59:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,969 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|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {209#true} is VALID [2022-04-07 21:59:28,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-07 21:59:28,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {209#true} {209#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-07 21:59:28,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 21:59:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:28,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#(= |#memory_int| |old(#memory_int)|)} [80] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {209#true} is VALID [2022-04-07 21:59:28,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-07 21:59:28,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {209#true} {209#true} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {209#true} is VALID [2022-04-07 21:59:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 21:59:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:29,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {209#true} [84] linear_searchENTRY-->L17-5: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {209#true} is VALID [2022-04-07 21:59:29,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {209#true} [87] L17-5-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_4 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and (not |v_linear_search_#t~short5_5|) (not .cse0)) (and .cse0 |v_linear_search_#t~short5_5|))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {209#true} is VALID [2022-04-07 21:59:29,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#true} [92] L17-1-->L17-3: Formula: (and (= (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_7 4294967296) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {209#true} is VALID [2022-04-07 21:59:29,014 INFO L290 TraceCheckUtils]: 3: Hoare triple {209#true} [97] L17-3-->L17-6: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {209#true} is VALID [2022-04-07 21:59:29,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {209#true} [90] L17-6-->linear_searchFINAL: Formula: (and (< (mod v_linear_search_~j~0_5 4294967296) (mod v_~SIZE~0_1 4294967296)) (= |v_linear_search_#res_1| 1)) InVars {~SIZE~0=v_~SIZE~0_1, linear_search_~j~0=v_linear_search_~j~0_5} OutVars{~SIZE~0=v_~SIZE~0_1, linear_search_#res=|v_linear_search_#res_1|, linear_search_~j~0=v_linear_search_~j~0_5} AuxVars[] AssignedVars[linear_search_#res] {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 21:59:29,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 21:59:29,017 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {209#true} [105] linear_searchEXIT-->L29-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {224#(= |main_#t~ret9| 1)} is VALID [2022-04-07 21:59:29,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {209#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {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-07 21:59:29,018 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|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {209#true} is VALID [2022-04-07 21:59:29,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-07 21:59:29,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {209#true} {209#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-07 21:59:29,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {209#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-07 21:59:29,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#true} [73] mainENTRY-->L26: Formula: (= v_~SIZE~0_6 (+ (div (mod |v_main_#t~nondet7_2| 4294967296) 8) 1)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_6} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {209#true} is VALID [2022-04-07 21:59:29,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#true} [75] L26-->L27: Formula: (let ((.cse0 (mod v_~SIZE~0_7 4294967296))) (and (not (= |v_main_#t~malloc8.base_2| 0)) (= |v_main_#t~malloc8.offset_2| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_2| (* .cse0 4)) |v_#length_1|) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_2|) 0) (< .cse0 (mod v_~MAX~0_2 4294967296)) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_2| 1)) (< |v_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|))) InVars {~SIZE~0=v_~SIZE~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_2, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_7, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_2|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_2} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {209#true} is VALID [2022-04-07 21:59:29,020 INFO L272 TraceCheckUtils]: 7: Hoare triple {209#true} [77] L27-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {228#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 21:59:29,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {228#(= |#memory_int| |old(#memory_int)|)} [80] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {209#true} is VALID [2022-04-07 21:59:29,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {209#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {209#true} is VALID [2022-04-07 21:59:29,021 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {209#true} {209#true} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {209#true} is VALID [2022-04-07 21:59:29,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {209#true} [79] L27-1-->L29: Formula: (and (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_1|) (= (store |v_#memory_int_3| v_main_~a~0.base_1 (store (select |v_#memory_int_3| v_main_~a~0.base_1) (+ (* 4 (mod (div (mod v_~SIZE~0_3 4294967296) 2) 4294967296)) v_main_~a~0.offset_1) 3)) |v_#memory_int_2|) (= |v_main_#t~malloc8.offset_1| v_main_~a~0.offset_1)) InVars {~SIZE~0=v_~SIZE~0_3, #memory_int=|v_#memory_int_3|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|} OutVars{~SIZE~0=v_~SIZE~0_3, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #memory_int=|v_#memory_int_2|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {209#true} is VALID [2022-04-07 21:59:29,021 INFO L272 TraceCheckUtils]: 12: Hoare triple {209#true} [81] L29-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {209#true} is VALID [2022-04-07 21:59:29,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {209#true} [84] linear_searchENTRY-->L17-5: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {209#true} is VALID [2022-04-07 21:59:29,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {209#true} [87] L17-5-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_4 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and (not |v_linear_search_#t~short5_5|) (not .cse0)) (and .cse0 |v_linear_search_#t~short5_5|))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {209#true} is VALID [2022-04-07 21:59:29,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {209#true} [92] L17-1-->L17-3: Formula: (and (= (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_7 4294967296) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {209#true} is VALID [2022-04-07 21:59:29,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {209#true} [97] L17-3-->L17-6: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {209#true} is VALID [2022-04-07 21:59:29,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {209#true} [90] L17-6-->linear_searchFINAL: Formula: (and (< (mod v_linear_search_~j~0_5 4294967296) (mod v_~SIZE~0_1 4294967296)) (= |v_linear_search_#res_1| 1)) InVars {~SIZE~0=v_~SIZE~0_1, linear_search_~j~0=v_linear_search_~j~0_5} OutVars{~SIZE~0=v_~SIZE~0_1, linear_search_#res=|v_linear_search_#res_1|, linear_search_~j~0=v_linear_search_~j~0_5} AuxVars[] AssignedVars[linear_search_#res] {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 21:59:29,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 21:59:29,025 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {229#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {209#true} [105] linear_searchEXIT-->L29-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {224#(= |main_#t~ret9| 1)} is VALID [2022-04-07 21:59:29,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {224#(= |main_#t~ret9| 1)} [83] L29-1-->L29-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {224#(= |main_#t~ret9| 1)} is VALID [2022-04-07 21:59:29,027 INFO L272 TraceCheckUtils]: 21: Hoare triple {224#(= |main_#t~ret9| 1)} [85] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {225#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-07 21:59:29,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {225#(= |__VERIFIER_assert_#in~cond| 1)} [89] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {226#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-07 21:59:29,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {226#(= __VERIFIER_assert_~cond 1)} [94] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {210#false} is VALID [2022-04-07 21:59:29,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {210#false} [99] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#false} is VALID [2022-04-07 21:59:29,028 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-07 21:59:29,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:29,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102031422] [2022-04-07 21:59:29,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102031422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:59:29,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:59:29,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 21:59:29,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882634283] [2022-04-07 21:59:29,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:59:29,030 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-07 21:59:29,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:29,031 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-07 21:59:29,105 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-07 21:59:29,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 21:59:29,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:29,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 21:59:29,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-07 21:59:29,107 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-07 21:59:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:29,447 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-07 21:59:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 21:59:29,448 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-07 21:59:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:29,448 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-07 21:59:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-07 21:59:29,453 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-07 21:59:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-07 21:59:29,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-07 21:59:29,488 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-07 21:59:29,489 INFO L225 Difference]: With dead ends: 34 [2022-04-07 21:59:29,489 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 21:59:29,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-07 21:59:29,490 INFO L913 BasicCegarLoop]: 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-07 21:59:29,490 INFO L914 BasicCegarLoop]: 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-07 21:59:29,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 21:59:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-07 21:59:29,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:29,493 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-07 21:59:29,494 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-07 21:59:29,494 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-07 21:59:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:29,495 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-07 21:59:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-07 21:59:29,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:29,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:29,496 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-07 21:59:29,496 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-07 21:59:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:29,497 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-07 21:59:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-07 21:59:29,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:29,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:29,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:29,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:29,498 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-07 21:59:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-07 21:59:29,499 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2022-04-07 21:59:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:29,499 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-07 21:59:29,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 21:59:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-07 21:59:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 21:59:29,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:29,500 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:29,500 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 21:59:29,500 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 673547012, now seen corresponding path program 1 times [2022-04-07 21:59:29,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:29,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698048629] [2022-04-07 21:59:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:29,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:29,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {394#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {395#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:29,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {395#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:29,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {395#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {377#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:29,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 21:59:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:29,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {396#(= |#memory_int| |old(#memory_int)|)} [80] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {377#true} is VALID [2022-04-07 21:59:29,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {377#true} is VALID [2022-04-07 21:59:29,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {377#true} {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:29,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 21:59:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:29,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#true} [84] linear_searchENTRY-->L17-5: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 21:59:29,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [87] L17-5-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_4 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and (not |v_linear_search_#t~short5_5|) (not .cse0)) (and .cse0 |v_linear_search_#t~short5_5|))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {398#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-07 21:59:29,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} [92] L17-1-->L17-3: Formula: (and (= (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_7 4294967296) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 21:59:29,762 INFO L290 TraceCheckUtils]: 3: Hoare triple {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [97] L17-3-->L17-6: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 21:59:29,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [91] L17-6-->linear_searchFINAL: Formula: (and (= |v_linear_search_#res_2| 0) (not (< (mod v_linear_search_~j~0_6 4294967296) (mod v_~SIZE~0_2 4294967296)))) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_6} AuxVars[] AssignedVars[linear_search_#res] {399#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 21:59:29,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {399#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 21:59:29,767 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {399#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [105] linear_searchEXIT-->L29-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {378#false} is VALID [2022-04-07 21:59:29,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {394#(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-07 21:59:29,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {394#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {395#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:29,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {395#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {395#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:29,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {395#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {377#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:29,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {382#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:29,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {382#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} [73] mainENTRY-->L26: Formula: (= v_~SIZE~0_6 (+ (div (mod |v_main_#t~nondet7_2| 4294967296) 8) 1)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_6} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {382#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:29,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {382#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} [75] L26-->L27: Formula: (let ((.cse0 (mod v_~SIZE~0_7 4294967296))) (and (not (= |v_main_#t~malloc8.base_2| 0)) (= |v_main_#t~malloc8.offset_2| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_2| (* .cse0 4)) |v_#length_1|) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_2|) 0) (< .cse0 (mod v_~MAX~0_2 4294967296)) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_2| 1)) (< |v_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|))) InVars {~SIZE~0=v_~SIZE~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_2, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_7, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_2|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_2} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:29,775 INFO L272 TraceCheckUtils]: 7: Hoare triple {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [77] L27-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {396#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 21:59:29,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#(= |#memory_int| |old(#memory_int)|)} [80] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {377#true} is VALID [2022-04-07 21:59:29,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {377#true} is VALID [2022-04-07 21:59:29,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#true} {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:29,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [79] L27-1-->L29: Formula: (and (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_1|) (= (store |v_#memory_int_3| v_main_~a~0.base_1 (store (select |v_#memory_int_3| v_main_~a~0.base_1) (+ (* 4 (mod (div (mod v_~SIZE~0_3 4294967296) 2) 4294967296)) v_main_~a~0.offset_1) 3)) |v_#memory_int_2|) (= |v_main_#t~malloc8.offset_1| v_main_~a~0.offset_1)) InVars {~SIZE~0=v_~SIZE~0_3, #memory_int=|v_#memory_int_3|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|} OutVars{~SIZE~0=v_~SIZE~0_3, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #memory_int=|v_#memory_int_2|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:29,777 INFO L272 TraceCheckUtils]: 12: Hoare triple {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [81] L29-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {377#true} is VALID [2022-04-07 21:59:29,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#true} [84] linear_searchENTRY-->L17-5: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 21:59:29,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [87] L17-5-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_4 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and (not |v_linear_search_#t~short5_5|) (not .cse0)) (and .cse0 |v_linear_search_#t~short5_5|))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {398#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-07 21:59:29,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {398#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} [92] L17-1-->L17-3: Formula: (and (= (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_7 4294967296) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 21:59:29,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [97] L17-3-->L17-6: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 21:59:29,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {397#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [91] L17-6-->linear_searchFINAL: Formula: (and (= |v_linear_search_#res_2| 0) (not (< (mod v_linear_search_~j~0_6 4294967296) (mod v_~SIZE~0_2 4294967296)))) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_6} AuxVars[] AssignedVars[linear_search_#res] {399#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 21:59:29,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {399#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {399#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 21:59:29,784 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {399#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {383#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [105] linear_searchEXIT-->L29-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {378#false} is VALID [2022-04-07 21:59:29,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {378#false} [83] L29-1-->L29-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {378#false} is VALID [2022-04-07 21:59:29,785 INFO L272 TraceCheckUtils]: 21: Hoare triple {378#false} [85] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {378#false} is VALID [2022-04-07 21:59:29,785 INFO L290 TraceCheckUtils]: 22: Hoare triple {378#false} [89] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {378#false} is VALID [2022-04-07 21:59:29,785 INFO L290 TraceCheckUtils]: 23: Hoare triple {378#false} [94] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {378#false} is VALID [2022-04-07 21:59:29,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {378#false} [99] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {378#false} is VALID [2022-04-07 21:59:29,785 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-07 21:59:29,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:29,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698048629] [2022-04-07 21:59:29,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698048629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 21:59:29,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 21:59:29,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-07 21:59:29,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186460683] [2022-04-07 21:59:29,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 21:59:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-07 21:59:29,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 21:59:29,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 21:59:29,810 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-07 21:59:29,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 21:59:29,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 21:59:29,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 21:59:29,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-07 21:59:29,812 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 21:59:32,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 21:59:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:32,741 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-07 21:59:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-07 21:59:32,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-07 21:59:32,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 21:59:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 21:59:32,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-07 21:59:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 21:59:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-07 21:59:32,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 42 transitions. [2022-04-07 21:59:32,793 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-07 21:59:32,794 INFO L225 Difference]: With dead ends: 39 [2022-04-07 21:59:32,794 INFO L226 Difference]: Without dead ends: 30 [2022-04-07 21:59:32,795 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2022-04-07 21:59:32,796 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 21:59:32,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 41 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 110 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 21:59:32,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-07 21:59:32,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-07 21:59:32,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 21:59:32,818 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-07 21:59:32,818 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-07 21:59:32,818 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-07 21:59:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:32,820 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-07 21:59:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-07 21:59:32,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:32,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:32,820 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-07 21:59:32,820 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-07 21:59:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 21:59:32,842 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-07 21:59:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-07 21:59:32,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 21:59:32,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 21:59:32,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 21:59:32,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 21:59:32,843 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-07 21:59:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-07 21:59:32,844 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-07 21:59:32,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 21:59:32,844 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-07 21:59:32,844 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 21:59:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-07 21:59:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 21:59:32,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 21:59:32,845 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 21:59:32,845 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 21:59:32,845 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 21:59:32,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 21:59:32,846 INFO L85 PathProgramCache]: Analyzing trace with hash -977632473, now seen corresponding path program 1 times [2022-04-07 21:59:32,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 21:59:32,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539563943] [2022-04-07 21:59:32,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 21:59:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:32,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 21:59:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:32,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {601#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {602#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:32,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {602#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:32,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {602#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {581#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 21:59:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:32,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#(= |#memory_int| |old(#memory_int)|)} [80] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {581#true} is VALID [2022-04-07 21:59:32,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {581#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {581#true} is VALID [2022-04-07 21:59:32,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {581#true} {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:32,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 21:59:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 21:59:33,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {581#true} [84] linear_searchENTRY-->L17-5: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {604#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 21:59:33,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [87] L17-5-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_4 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and (not |v_linear_search_#t~short5_5|) (not .cse0)) (and .cse0 |v_linear_search_#t~short5_5|))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {605#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:33,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} [92] L17-1-->L17-3: Formula: (and (= (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_7 4294967296) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {605#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:33,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} [98] L17-3-->L17-5: Formula: (and (= (+ v_linear_search_~j~0_3 1) v_linear_search_~j~0_2) |v_linear_search_#t~short5_4|) InVars {linear_search_~j~0=v_linear_search_~j~0_3, linear_search_#t~short5=|v_linear_search_#t~short5_4|} OutVars{linear_search_~j~0=v_linear_search_~j~0_2, linear_search_#t~post6=|v_linear_search_#t~post6_1|, linear_search_#t~mem4=|v_linear_search_#t~mem4_2|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {606#(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-07 21:59:33,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {606#(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))))} [87] L17-5-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_4 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and (not |v_linear_search_#t~short5_5|) (not .cse0)) (and .cse0 |v_linear_search_#t~short5_5|))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {607#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} is VALID [2022-04-07 21:59:33,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {607#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} [92] L17-1-->L17-3: Formula: (and (= (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_7 4294967296) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {608#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 21:59:33,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {608#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} [97] L17-3-->L17-6: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {608#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 21:59:33,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {608#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} [91] L17-6-->linear_searchFINAL: Formula: (and (= |v_linear_search_#res_2| 0) (not (< (mod v_linear_search_~j~0_6 4294967296) (mod v_~SIZE~0_2 4294967296)))) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_6} AuxVars[] AssignedVars[linear_search_#res] {609#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 21:59:33,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {609#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 21:59:33,214 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {609#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [105] linear_searchEXIT-->L29-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {582#false} is VALID [2022-04-07 21:59:33,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {581#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#(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-07 21:59:33,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [71] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {602#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:33,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {602#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:33,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {602#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {581#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:33,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {586#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {586#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:33,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} [73] mainENTRY-->L26: Formula: (= v_~SIZE~0_6 (+ (div (mod |v_main_#t~nondet7_2| 4294967296) 8) 1)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_6} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {586#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-07 21:59:33,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {586#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} [75] L26-->L27: Formula: (let ((.cse0 (mod v_~SIZE~0_7 4294967296))) (and (not (= |v_main_#t~malloc8.base_2| 0)) (= |v_main_#t~malloc8.offset_2| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_2| (* .cse0 4)) |v_#length_1|) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_2|) 0) (< .cse0 (mod v_~MAX~0_2 4294967296)) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_2| 1)) (< |v_main_#t~malloc8.base_2| |v_#StackHeapBarrier_1|))) InVars {~SIZE~0=v_~SIZE~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_2, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_7, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_2|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_2} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:33,220 INFO L272 TraceCheckUtils]: 7: Hoare triple {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [77] L27-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {603#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 21:59:33,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#(= |#memory_int| |old(#memory_int)|)} [80] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {581#true} is VALID [2022-04-07 21:59:33,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {581#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {581#true} is VALID [2022-04-07 21:59:33,221 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {581#true} {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:33,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [79] L27-1-->L29: Formula: (and (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_1|) (= (store |v_#memory_int_3| v_main_~a~0.base_1 (store (select |v_#memory_int_3| v_main_~a~0.base_1) (+ (* 4 (mod (div (mod v_~SIZE~0_3 4294967296) 2) 4294967296)) v_main_~a~0.offset_1) 3)) |v_#memory_int_2|) (= |v_main_#t~malloc8.offset_1| v_main_~a~0.offset_1)) InVars {~SIZE~0=v_~SIZE~0_3, #memory_int=|v_#memory_int_3|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|} OutVars{~SIZE~0=v_~SIZE~0_3, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #memory_int=|v_#memory_int_2|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:33,221 INFO L272 TraceCheckUtils]: 12: Hoare triple {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [81] L29-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {581#true} is VALID [2022-04-07 21:59:33,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {581#true} [84] linear_searchENTRY-->L17-5: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {604#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 21:59:33,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {604#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [87] L17-5-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_4 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and (not |v_linear_search_#t~short5_5|) (not .cse0)) (and .cse0 |v_linear_search_#t~short5_5|))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {605#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:33,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} [92] L17-1-->L17-3: Formula: (and (= (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_7 4294967296) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {605#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-07 21:59:33,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} [98] L17-3-->L17-5: Formula: (and (= (+ v_linear_search_~j~0_3 1) v_linear_search_~j~0_2) |v_linear_search_#t~short5_4|) InVars {linear_search_~j~0=v_linear_search_~j~0_3, linear_search_#t~short5=|v_linear_search_#t~short5_4|} OutVars{linear_search_~j~0=v_linear_search_~j~0_2, linear_search_#t~post6=|v_linear_search_#t~post6_1|, linear_search_#t~mem4=|v_linear_search_#t~mem4_2|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {606#(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-07 21:59:33,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {606#(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))))} [87] L17-5-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_4 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and (not |v_linear_search_#t~short5_5|) (not .cse0)) (and .cse0 |v_linear_search_#t~short5_5|))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_4, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {607#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} is VALID [2022-04-07 21:59:33,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} [92] L17-1-->L17-3: Formula: (and (= (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_7 4294967296) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_7, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {608#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 21:59:33,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {608#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} [97] L17-3-->L17-6: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {608#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 21:59:33,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {608#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} [91] L17-6-->linear_searchFINAL: Formula: (and (= |v_linear_search_#res_2| 0) (not (< (mod v_linear_search_~j~0_6 4294967296) (mod v_~SIZE~0_2 4294967296)))) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_6} AuxVars[] AssignedVars[linear_search_#res] {609#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 21:59:33,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {609#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {609#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 21:59:33,228 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {609#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {587#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [105] linear_searchEXIT-->L29-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {582#false} is VALID [2022-04-07 21:59:33,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {582#false} [83] L29-1-->L29-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {582#false} is VALID [2022-04-07 21:59:33,228 INFO L272 TraceCheckUtils]: 24: Hoare triple {582#false} [85] L29-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {582#false} is VALID [2022-04-07 21:59:33,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {582#false} [89] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {582#false} is VALID [2022-04-07 21:59:33,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {582#false} [94] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {582#false} is VALID [2022-04-07 21:59:33,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {582#false} [99] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#false} is VALID [2022-04-07 21:59:33,229 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-07 21:59:33,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 21:59:33,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539563943] [2022-04-07 21:59:33,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539563943] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 21:59:33,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358584454] [2022-04-07 21:59:33,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 21:59:33,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 21:59:33,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 21:59:33,248 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-07 21:59:33,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process