/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/linear_sea.ch.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:41:49,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:41:49,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:41:49,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:41:49,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:41:49,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:41:49,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:41:49,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:41:49,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:41:49,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:41:49,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:41:49,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:41:49,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:41:49,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:41:49,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:41:49,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:41:49,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:41:49,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:41:49,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:41:49,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:41:49,789 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:41:49,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:41:49,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:41:49,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:41:49,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:41:49,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:41:49,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:41:49,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:41:49,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:41:49,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:41:49,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:41:49,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:41:49,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:41:49,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:41:49,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:41:49,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:41:49,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:41:49,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:41:49,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:41:49,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:41:49,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:41:49,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:41:49,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:41:49,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:41:49,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:41:49,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:41:49,840 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:41:49,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:41:49,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:41:49,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:41:49,840 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:41:49,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:41:49,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:41:49,841 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:41:49,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:41:49,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:41:49,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:41:49,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:41:49,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:41:49,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:41:49,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:41:49,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:41:49,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:41:49,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:41:49,844 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:41:49,844 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 16:41:50,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:41:50,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:41:50,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:41:50,076 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:41:50,076 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:41:50,077 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 16:41:50,120 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3333909/24ae39933b48490092b5f132de5ad234/FLAGa6386445c [2022-04-07 16:41:50,496 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:41:50,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c [2022-04-07 16:41:50,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3333909/24ae39933b48490092b5f132de5ad234/FLAGa6386445c [2022-04-07 16:41:50,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f3333909/24ae39933b48490092b5f132de5ad234 [2022-04-07 16:41:50,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:41:50,946 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:41:50,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:41:50,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:41:50,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:41:50,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:41:50" (1/1) ... [2022-04-07 16:41:50,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51353290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:50, skipping insertion in model container [2022-04-07 16:41:50,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:41:50" (1/1) ... [2022-04-07 16:41:50,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:41:50,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:41:51,131 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 16:41:51,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:41:51,176 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:41:51,186 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 16:41:51,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:41:51,204 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:41:51,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51 WrapperNode [2022-04-07 16:41:51,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:41:51,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:41:51,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:41:51,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:41:51,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:41:51,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:41:51,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:41:51,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:41:51,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:41:51,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:41:51,276 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 16:41:51,282 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 16:41:51,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:41:51,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:41:51,309 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:41:51,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:41:51,309 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-07 16:41:51,309 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:41:51,309 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-07 16:41:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:41:51,309 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:41:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:41:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:41:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-07 16:41:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:41:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 16:41:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-07 16:41:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:41:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:41:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-07 16:41:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-07 16:41:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:41:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:41:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:41:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:41:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:41:51,376 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:41:51,377 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:41:51,529 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:41:51,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:41:51,535 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:41:51,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:51 BoogieIcfgContainer [2022-04-07 16:41:51,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:41:51,538 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:41:51,538 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:41:51,539 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:41:51,542 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,544 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:41:51,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:41:51 BasicIcfg [2022-04-07 16:41:51,576 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:41:51,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:41:51,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:41:51,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:41:51,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:41:50" (1/4) ... [2022-04-07 16:41:51,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260a5253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:41:51, skipping insertion in model container [2022-04-07 16:41:51,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51" (2/4) ... [2022-04-07 16:41:51,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260a5253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:41:51, skipping insertion in model container [2022-04-07 16:41:51,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:51" (3/4) ... [2022-04-07 16:41:51,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260a5253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:41:51, skipping insertion in model container [2022-04-07 16:41:51,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:41:51" (4/4) ... [2022-04-07 16:41:51,594 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.cJordan [2022-04-07 16:41:51,619 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:41:51,619 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:41:51,694 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:41:51,713 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 16:41:51,713 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:41:51,734 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 16:41:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 16:41:51,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:51,744 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 16:41:51,744 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:51,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash -679551393, now seen corresponding path program 1 times [2022-04-07 16:41:51,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:51,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647605209] [2022-04-07 16:41:51,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:51,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:52,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:52,130 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 16:41:52,131 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 16:41:52,131 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 16:41:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:41:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:52,151 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 16:41:52,151 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 16:41:52,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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 16:41:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 16:41:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:52,174 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 16:41:52,175 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 16:41:52,176 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 16:41:52,176 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 16:41:52,176 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 16:41:52,177 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 16:41:52,178 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 16:41:52,179 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 16:41:52,179 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 16:41:52,179 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 16:41:52,180 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 16:41:52,180 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) (< 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|) (= (store |v_#length_2| |v_main_#t~malloc8.base_2| (* v_~SIZE~0_7 4)) |v_#length_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 16:41:52,183 INFO L272 TraceCheckUtils]: 7: Hoare triple {36#true} [77] L27-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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 16:41:52,184 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 16:41:52,184 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 16:41:52,185 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#true} {36#true} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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 16:41:52,186 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) (+ (* (let ((.cse0 (mod (div (mod v_~SIZE~0_3 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) 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 16:41:52,186 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 16:41:52,187 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 16:41:52,188 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 16:41:52,188 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 16:41:52,188 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 16:41:52,189 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 16:41:52,189 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 16:41:52,190 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 16:41:52,191 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 16:41:52,191 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 16:41:52,191 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 16:41:52,192 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 16:41:52,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:52,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647605209] [2022-04-07 16:41:52,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647605209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:41:52,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:41:52,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:41:52,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772065181] [2022-04-07 16:41:52,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:41:52,202 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 16:41:52,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:52,206 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 16:41:52,243 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 16:41:52,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:41:52,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:52,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:41:52,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:41:52,274 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 16:41:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:52,504 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-07 16:41:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:41:52,505 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 16:41:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:41:52,506 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 16:41:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-07 16:41:52,514 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 16:41:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-07 16:41:52,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-07 16:41:52,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:52,580 INFO L225 Difference]: With dead ends: 35 [2022-04-07 16:41:52,580 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 16:41:52,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:41:52,585 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 16:41:52,586 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 16:41:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 16:41:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-07 16:41:52,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:41:52,609 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 16:41:52,610 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 16:41:52,610 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 16:41:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:52,613 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-07 16:41:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 16:41:52,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:52,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:52,614 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 16:41:52,615 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 16:41:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:52,618 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-07 16:41:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 16:41:52,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:52,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:52,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:41:52,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:41:52,619 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 16:41:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-07 16:41:52,622 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-04-07 16:41:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:41:52,623 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-07 16:41:52,623 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 16:41:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-07 16:41:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 16:41:52,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:52,624 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 16:41:52,624 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:41:52,625 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:52,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:52,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1069263323, now seen corresponding path program 1 times [2022-04-07 16:41:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:52,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325295025] [2022-04-07 16:41:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:52,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:52,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#(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] {169#true} is VALID [2022-04-07 16:41:52,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-07 16:41:52,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-07 16:41:52,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:41:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:52,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#(= |#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] {169#true} is VALID [2022-04-07 16:41:52,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-07 16:41:52,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {169#true} is VALID [2022-04-07 16:41:52,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 16:41:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:52,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#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] {169#true} is VALID [2022-04-07 16:41:52,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#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] {169#true} is VALID [2022-04-07 16:41:52,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} [92] L17-1-->L17-3: Formula: (and (= (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (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] {169#true} is VALID [2022-04-07 16:41:52,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {169#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] {169#true} is VALID [2022-04-07 16:41:52,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {169#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] {189#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 16:41:52,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 16:41:52,856 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {189#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {169#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] {184#(= |main_#t~ret9| 1)} is VALID [2022-04-07 16:41:52,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {169#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#(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 16:41:52,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(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] {169#true} is VALID [2022-04-07 16:41:52,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {169#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-07 16:41:52,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169#true} {169#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-07 16:41:52,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {169#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-07 16:41:52,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {169#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] {169#true} is VALID [2022-04-07 16:41:52,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {169#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) (< 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|) (= (store |v_#length_2| |v_main_#t~malloc8.base_2| (* v_~SIZE~0_7 4)) |v_#length_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] {169#true} is VALID [2022-04-07 16:41:52,860 INFO L272 TraceCheckUtils]: 7: Hoare triple {169#true} [77] L27-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {188#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 16:41:52,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#(= |#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] {169#true} is VALID [2022-04-07 16:41:52,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {169#true} is VALID [2022-04-07 16:41:52,861 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {169#true} {169#true} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {169#true} is VALID [2022-04-07 16:41:52,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {169#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) (+ (* (let ((.cse0 (mod (div (mod v_~SIZE~0_3 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) 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] {169#true} is VALID [2022-04-07 16:41:52,861 INFO L272 TraceCheckUtils]: 12: Hoare triple {169#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] {169#true} is VALID [2022-04-07 16:41:52,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {169#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] {169#true} is VALID [2022-04-07 16:41:52,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {169#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] {169#true} is VALID [2022-04-07 16:41:52,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {169#true} [92] L17-1-->L17-3: Formula: (and (= (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (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] {169#true} is VALID [2022-04-07 16:41:52,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {169#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] {169#true} is VALID [2022-04-07 16:41:52,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {169#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] {189#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 16:41:52,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {189#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 16:41:52,865 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {189#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {169#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] {184#(= |main_#t~ret9| 1)} is VALID [2022-04-07 16:41:52,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {184#(= |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[] {184#(= |main_#t~ret9| 1)} is VALID [2022-04-07 16:41:52,867 INFO L272 TraceCheckUtils]: 21: Hoare triple {184#(= |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] {185#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-07 16:41:52,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {185#(= |__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] {186#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-07 16:41:52,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {186#(= __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[] {170#false} is VALID [2022-04-07 16:41:52,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {170#false} [99] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {170#false} is VALID [2022-04-07 16:41:52,869 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 16:41:52,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:52,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325295025] [2022-04-07 16:41:52,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325295025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:41:52,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:41:52,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 16:41:52,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643902534] [2022-04-07 16:41:52,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:41:52,872 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 16:41:52,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:52,873 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 16:41:52,896 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 16:41:52,897 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 16:41:52,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:52,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 16:41:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-07 16:41:52,898 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 16:41:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:53,265 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-07 16:41:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 16:41:53,266 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 16:41:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:41:53,268 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 16:41:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-07 16:41:53,277 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 16:41:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 34 transitions. [2022-04-07 16:41:53,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 34 transitions. [2022-04-07 16:41:53,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:53,325 INFO L225 Difference]: With dead ends: 32 [2022-04-07 16:41:53,325 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 16:41:53,325 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 16:41:53,328 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.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:41:53,329 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.2s Time] [2022-04-07 16:41:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 16:41:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-07 16:41:53,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:41:53,335 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 16:41:53,335 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 16:41:53,337 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 16:41:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:53,339 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-07 16:41:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-07 16:41:53,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:53,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:53,341 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 16:41:53,342 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 16:41:53,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:53,348 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-07 16:41:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-07 16:41:53,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:53,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:53,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:41:53,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:41:53,352 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 16:41:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-07 16:41:53,353 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2022-04-07 16:41:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:41:53,353 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-07 16:41:53,354 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 16:41:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-07 16:41:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 16:41:53,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:53,355 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 16:41:53,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:41:53,355 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:53,355 INFO L85 PathProgramCache]: Analyzing trace with hash 673547012, now seen corresponding path program 1 times [2022-04-07 16:41:53,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:53,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907753354] [2022-04-07 16:41:53,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:53,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:53,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:53,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#(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] {311#true} is VALID [2022-04-07 16:41:53,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-04-07 16:41:53,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {311#true} {311#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-04-07 16:41:53,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:41:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:53,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#(= |#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] {311#true} is VALID [2022-04-07 16:41:53,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-04-07 16:41:53,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {311#true} {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 16:41:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:53,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#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] {329#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:53,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#(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] {330#(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 16:41:53,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#(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) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (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] {329#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:53,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {329#(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] {329#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:53,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#(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] {331#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 16:41:53,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {331#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 16:41:53,565 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {331#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [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] {312#false} is VALID [2022-04-07 16:41:53,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {311#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {327#(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 16:41:53,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#(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] {311#true} is VALID [2022-04-07 16:41:53,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-04-07 16:41:53,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {311#true} {311#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-04-07 16:41:53,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {311#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-04-07 16:41:53,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {311#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] {311#true} is VALID [2022-04-07 16:41:53,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#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) (< 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|) (= (store |v_#length_2| |v_main_#t~malloc8.base_2| (* v_~SIZE~0_7 4)) |v_#length_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] {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:53,569 INFO L272 TraceCheckUtils]: 7: Hoare triple {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [77] L27-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {328#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 16:41:53,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {328#(= |#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] {311#true} is VALID [2022-04-07 16:41:53,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {311#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {311#true} is VALID [2022-04-07 16:41:53,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {311#true} {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:53,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [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) (+ (* (let ((.cse0 (mod (div (mod v_~SIZE~0_3 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) 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] {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:53,571 INFO L272 TraceCheckUtils]: 12: Hoare triple {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [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] {311#true} is VALID [2022-04-07 16:41:53,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {311#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] {329#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:53,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {329#(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] {330#(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 16:41:53,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {330#(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) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (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] {329#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:53,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {329#(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] {329#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:53,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {329#(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] {331#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 16:41:53,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {331#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {331#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 16:41:53,577 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {331#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {316#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [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] {312#false} is VALID [2022-04-07 16:41:53,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {312#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[] {312#false} is VALID [2022-04-07 16:41:53,577 INFO L272 TraceCheckUtils]: 21: Hoare triple {312#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] {312#false} is VALID [2022-04-07 16:41:53,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {312#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] {312#false} is VALID [2022-04-07 16:41:53,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {312#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[] {312#false} is VALID [2022-04-07 16:41:53,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {312#false} [99] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {312#false} is VALID [2022-04-07 16:41:53,578 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 16:41:53,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:53,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907753354] [2022-04-07 16:41:53,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907753354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:41:53,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:41:53,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 16:41:53,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831073789] [2022-04-07 16:41:53,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:41:53,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-07 16:41:53,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:53,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 16:41:53,603 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 16:41:53,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 16:41:53,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:53,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 16:41:53,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-07 16:41:53,604 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 16:41:58,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-07 16:41:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:58,464 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-07 16:41:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 16:41:58,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-07 16:41:58,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:41:58,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 16:41:58,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 35 transitions. [2022-04-07 16:41:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 16:41:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 35 transitions. [2022-04-07 16:41:58,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 35 transitions. [2022-04-07 16:41:58,519 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 16:41:58,520 INFO L225 Difference]: With dead ends: 31 [2022-04-07 16:41:58,520 INFO L226 Difference]: Without dead ends: 30 [2022-04-07 16:41:58,520 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-04-07 16:41:58,521 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 59 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 16:41:58,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 36 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 16:41:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-07 16:41:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-07 16:41:58,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:41:58,524 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 16:41:58,524 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 16:41:58,525 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 16:41:58,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:58,526 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-07 16:41:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-07 16:41:58,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:58,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:58,527 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 16:41:58,527 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 16:41:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:58,529 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-07 16:41:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-07 16:41:58,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:58,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:58,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:41:58,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:41:58,530 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 16:41:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-07 16:41:58,531 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-07 16:41:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:41:58,531 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-07 16:41:58,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 16:41:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-07 16:41:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 16:41:58,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:58,532 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 16:41:58,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 16:41:58,533 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:58,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash -977632473, now seen corresponding path program 1 times [2022-04-07 16:41:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:58,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651893409] [2022-04-07 16:41:58,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:58,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:58,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:58,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#(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] {471#true} is VALID [2022-04-07 16:41:58,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {471#true} is VALID [2022-04-07 16:41:58,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {471#true} is VALID [2022-04-07 16:41:58,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:41:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:58,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {491#(= |#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] {471#true} is VALID [2022-04-07 16:41:58,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {471#true} is VALID [2022-04-07 16:41:58,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {471#true} {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 16:41:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:58,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#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] {492#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:41:58,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#(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] {493#(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 16:41:58,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {493#(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) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (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] {493#(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 16:41:58,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {493#(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] {494#(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 16:41:58,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {494#(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] {495#(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 16:41:58,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {495#(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) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (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] {496#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 16:41:58,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {496#(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] {496#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 16:41:58,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {496#(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] {497#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:41:58,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:41:58,892 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {497#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [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] {472#false} is VALID [2022-04-07 16:41:58,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {471#true} [69] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#(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 16:41:58,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#(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] {471#true} is VALID [2022-04-07 16:41:58,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} [74] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {471#true} is VALID [2022-04-07 16:41:58,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} [102] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {471#true} is VALID [2022-04-07 16:41:58,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {471#true} [70] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {471#true} is VALID [2022-04-07 16:41:58,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#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] {471#true} is VALID [2022-04-07 16:41:58,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#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) (< 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|) (= (store |v_#length_2| |v_main_#t~malloc8.base_2| (* v_~SIZE~0_7 4)) |v_#length_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] {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:58,896 INFO L272 TraceCheckUtils]: 7: Hoare triple {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [77] L27-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {491#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 16:41:58,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {491#(= |#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] {471#true} is VALID [2022-04-07 16:41:58,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} [82] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {471#true} is VALID [2022-04-07 16:41:58,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#true} {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [104] #Ultimate.meminitEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:58,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [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) (+ (* (let ((.cse0 (mod (div (mod v_~SIZE~0_3 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) 4) 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] {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:58,897 INFO L272 TraceCheckUtils]: 12: Hoare triple {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [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] {471#true} is VALID [2022-04-07 16:41:58,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {471#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] {492#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:41:58,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {492#(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] {493#(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 16:41:58,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {493#(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) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (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] {493#(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 16:41:58,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {493#(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] {494#(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 16:41:58,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {494#(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] {495#(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 16:41:58,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {495#(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) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_7 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2)) |v_linear_search_#t~mem4_3|) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (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] {496#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 16:41:58,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {496#(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] {496#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 16:41:58,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {496#(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] {497#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:41:58,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {497#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [96] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {497#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:41:58,907 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {497#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {476#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [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] {472#false} is VALID [2022-04-07 16:41:58,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {472#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[] {472#false} is VALID [2022-04-07 16:41:58,908 INFO L272 TraceCheckUtils]: 24: Hoare triple {472#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] {472#false} is VALID [2022-04-07 16:41:58,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {472#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] {472#false} is VALID [2022-04-07 16:41:58,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {472#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[] {472#false} is VALID [2022-04-07 16:41:58,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {472#false} [99] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {472#false} is VALID [2022-04-07 16:41:58,908 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 16:41:58,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:58,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651893409] [2022-04-07 16:41:58,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651893409] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:41:58,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120925929] [2022-04-07 16:41:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:41:58,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:41:58,915 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 16:41:58,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process