/usr/bin/java -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_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 20:32:12,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 20:32:12,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 20:32:12,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 20:32:12,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 20:32:12,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 20:32:12,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 20:32:12,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 20:32:12,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 20:32:12,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 20:32:12,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 20:32:12,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 20:32:12,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 20:32:12,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 20:32:12,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 20:32:12,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 20:32:12,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 20:32:12,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 20:32:12,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 20:32:12,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 20:32:12,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 20:32:12,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 20:32:12,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 20:32:12,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 20:32:12,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 20:32:12,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 20:32:12,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 20:32:12,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 20:32:12,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 20:32:12,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 20:32:12,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 20:32:12,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 20:32:12,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 20:32:12,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 20:32:12,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 20:32:12,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 20:32:12,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 20:32:12,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 20:32:12,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 20:32:12,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 20:32:12,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 20:32:12,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 20:32:12,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 20:32:12,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 20:32:12,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 20:32:12,416 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 20:32:12,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 20:32:12,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 20:32:12,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 20:32:12,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 20:32:12,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 20:32:12,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 20:32:12,417 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 20:32:12,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 20:32:12,417 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 20:32:12,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 20:32:12,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 20:32:12,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 20:32:12,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 20:32:12,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 20:32:12,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 20:32:12,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 20:32:12,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 20:32:12,419 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 20:32:12,419 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-02-14 20:32:12,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 20:32:12,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 20:32:12,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 20:32:12,652 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 20:32:12,654 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 20:32:12,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2022-02-14 20:32:12,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c499217b/852c3daa29d1472e939e705249ba00fc/FLAGca501ddba [2022-02-14 20:32:13,085 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 20:32:13,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2022-02-14 20:32:13,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c499217b/852c3daa29d1472e939e705249ba00fc/FLAGca501ddba [2022-02-14 20:32:13,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c499217b/852c3daa29d1472e939e705249ba00fc [2022-02-14 20:32:13,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 20:32:13,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 20:32:13,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 20:32:13,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 20:32:13,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 20:32:13,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 08:32:13" (1/1) ... [2022-02-14 20:32:13,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cff04df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13, skipping insertion in model container [2022-02-14 20:32:13,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 08:32:13" (1/1) ... [2022-02-14 20:32:13,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 20:32:13,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 20:32:13,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2022-02-14 20:32:13,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 20:32:13,328 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 20:32:13,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2022-02-14 20:32:13,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 20:32:13,357 INFO L208 MainTranslator]: Completed translation [2022-02-14 20:32:13,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13 WrapperNode [2022-02-14 20:32:13,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 20:32:13,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 20:32:13,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 20:32:13,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 20:32:13,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13" (1/1) ... [2022-02-14 20:32:13,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13" (1/1) ... [2022-02-14 20:32:13,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13" (1/1) ... [2022-02-14 20:32:13,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13" (1/1) ... [2022-02-14 20:32:13,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13" (1/1) ... [2022-02-14 20:32:13,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13" (1/1) ... [2022-02-14 20:32:13,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13" (1/1) ... [2022-02-14 20:32:13,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 20:32:13,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 20:32:13,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 20:32:13,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 20:32:13,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13" (1/1) ... [2022-02-14 20:32:13,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 20:32:13,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 20:32:13,422 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-02-14 20:32:13,440 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-02-14 20:32:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 20:32:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 20:32:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 20:32:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 20:32:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-02-14 20:32:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 20:32:13,454 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-14 20:32:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 20:32:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 20:32:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 20:32:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 20:32:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-02-14 20:32:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 20:32:13,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-14 20:32:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-02-14 20:32:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 20:32:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 20:32:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-14 20:32:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-14 20:32:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 20:32:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 20:32:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 20:32:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 20:32:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 20:32:13,524 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 20:32:13,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 20:32:15,762 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 20:32:15,772 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 20:32:15,772 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-14 20:32:15,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 08:32:15 BoogieIcfgContainer [2022-02-14 20:32:15,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 20:32:15,774 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 20:32:15,774 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 20:32:15,776 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 20:32:15,779 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 08:32:15" (1/1) ... [2022-02-14 20:32:15,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 08:32:15 BasicIcfg [2022-02-14 20:32:15,803 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 20:32:15,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 20:32:15,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 20:32:15,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 20:32:15,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 08:32:13" (1/4) ... [2022-02-14 20:32:15,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375739bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 08:32:15, skipping insertion in model container [2022-02-14 20:32:15,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 08:32:13" (2/4) ... [2022-02-14 20:32:15,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375739bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 08:32:15, skipping insertion in model container [2022-02-14 20:32:15,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 08:32:15" (3/4) ... [2022-02-14 20:32:15,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375739bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 08:32:15, skipping insertion in model container [2022-02-14 20:32:15,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 08:32:15" (4/4) ... [2022-02-14 20:32:15,808 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.cJordan [2022-02-14 20:32:15,811 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 20:32:15,812 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 20:32:15,846 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 20:32:15,853 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 20:32:15,853 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 20:32:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-14 20:32:15,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-14 20:32:15,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 20:32:15,867 INFO L514 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-02-14 20:32:15,867 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 20:32:15,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 20:32:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1395824931, now seen corresponding path program 1 times [2022-02-14 20:32:15,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 20:32:15,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641348879] [2022-02-14 20:32:15,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 20:32:15,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 20:32:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 20:32:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-14 20:32:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-14 20:32:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 20:32:16,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 20:32:16,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641348879] [2022-02-14 20:32:16,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641348879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 20:32:16,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 20:32:16,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-14 20:32:16,128 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540746049] [2022-02-14 20:32:16,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 20:32:16,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-14 20:32:16,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 20:32:16,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-14 20:32:16,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-14 20:32:16,156 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-14 20:32:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 20:32:16,247 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-14 20:32:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-14 20:32:16,249 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-02-14 20:32:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 20:32:16,256 INFO L225 Difference]: With dead ends: 36 [2022-02-14 20:32:16,256 INFO L226 Difference]: Without dead ends: 27 [2022-02-14 20:32:16,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-14 20:32:16,261 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 20:32:16,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 20:32:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-14 20:32:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-14 20:32:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 20:32:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-02-14 20:32:16,285 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-02-14 20:32:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 20:32:16,285 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-02-14 20:32:16,285 INFO L471 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-02-14 20:32:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-14 20:32:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-14 20:32:16,286 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 20:32:16,287 INFO L514 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-02-14 20:32:16,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 20:32:16,287 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 20:32:16,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 20:32:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1369163817, now seen corresponding path program 1 times [2022-02-14 20:32:16,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 20:32:16,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393021747] [2022-02-14 20:32:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 20:32:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 20:32:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 20:32:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-14 20:32:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-14 20:32:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 20:32:16,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 20:32:16,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393021747] [2022-02-14 20:32:16,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393021747] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 20:32:16,442 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 20:32:16,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-14 20:32:16,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672454564] [2022-02-14 20:32:16,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 20:32:16,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 20:32:16,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 20:32:16,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 20:32:16,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-14 20:32:16,444 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-14 20:32:16,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 20:32:16,596 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-02-14 20:32:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 20:32:16,596 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-02-14 20:32:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 20:32:16,598 INFO L225 Difference]: With dead ends: 33 [2022-02-14 20:32:16,598 INFO L226 Difference]: Without dead ends: 27 [2022-02-14 20:32:16,600 INFO L932 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-02-14 20:32:16,603 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 20:32:16,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 50 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 20:32:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-14 20:32:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-14 20:32:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 20:32:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-14 20:32:16,612 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-02-14 20:32:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 20:32:16,613 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-14 20:32:16,613 INFO L471 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-02-14 20:32:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-14 20:32:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-14 20:32:16,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 20:32:16,614 INFO L514 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-02-14 20:32:16,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 20:32:16,614 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 20:32:16,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 20:32:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1182993144, now seen corresponding path program 1 times [2022-02-14 20:32:16,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 20:32:16,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457204842] [2022-02-14 20:32:16,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 20:32:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 20:32:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 20:32:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-14 20:32:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-14 20:32:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 20:32:16,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 20:32:16,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457204842] [2022-02-14 20:32:16,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457204842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 20:32:16,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 20:32:16,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-14 20:32:16,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156417994] [2022-02-14 20:32:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 20:32:16,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 20:32:16,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 20:32:16,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 20:32:16,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-14 20:32:16,768 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-14 20:32:18,887 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-02-14 20:32:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 20:32:19,155 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-14 20:32:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-14 20:32:19,156 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-02-14 20:32:19,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 20:32:19,157 INFO L225 Difference]: With dead ends: 32 [2022-02-14 20:32:19,157 INFO L226 Difference]: Without dead ends: 31 [2022-02-14 20:32:19,157 INFO L932 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-02-14 20:32:19,158 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 66 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-14 20:32:19,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 31 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-02-14 20:32:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-14 20:32:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-14 20:32:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 20:32:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-14 20:32:19,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-02-14 20:32:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 20:32:19,162 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-14 20:32:19,162 INFO L471 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-02-14 20:32:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-14 20:32:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-14 20:32:19,162 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 20:32:19,163 INFO L514 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, 1] [2022-02-14 20:32:19,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-14 20:32:19,163 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 20:32:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 20:32:19,163 INFO L85 PathProgramCache]: Analyzing trace with hash -503218689, now seen corresponding path program 1 times [2022-02-14 20:32:19,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 20:32:19,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913305954] [2022-02-14 20:32:19,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 20:32:19,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 20:32:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:19,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 20:32:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:19,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-14 20:32:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-14 20:32:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 20:32:19,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 20:32:19,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913305954] [2022-02-14 20:32:19,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913305954] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 20:32:19,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 20:32:19,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 20:32:19,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591503583] [2022-02-14 20:32:19,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 20:32:19,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 20:32:19,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 20:32:19,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 20:32:19,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-14 20:32:19,293 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-14 20:32:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 20:32:19,444 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-02-14 20:32:19,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 20:32:19,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-02-14 20:32:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 20:32:19,446 INFO L225 Difference]: With dead ends: 37 [2022-02-14 20:32:19,446 INFO L226 Difference]: Without dead ends: 37 [2022-02-14 20:32:19,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-14 20:32:19,447 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 20:32:19,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 39 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-14 20:32:19,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-14 20:32:19,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-02-14 20:32:19,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 20:32:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-02-14 20:32:19,451 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2022-02-14 20:32:19,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 20:32:19,451 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-02-14 20:32:19,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-14 20:32:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-14 20:32:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-14 20:32:19,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 20:32:19,452 INFO L514 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, 1] [2022-02-14 20:32:19,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-14 20:32:19,452 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 20:32:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 20:32:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash -374135970, now seen corresponding path program 1 times [2022-02-14 20:32:19,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 20:32:19,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472657781] [2022-02-14 20:32:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 20:32:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 20:32:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 20:32:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-14 20:32:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:19,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-14 20:32:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 20:32:19,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 20:32:19,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472657781] [2022-02-14 20:32:19,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472657781] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 20:32:19,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537764603] [2022-02-14 20:32:19,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 20:32:19,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 20:32:19,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 20:32:19,734 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-02-14 20:32:19,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-14 20:32:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:32:19,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-14 20:32:19,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 20:32:19,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-02-14 20:32:20,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2022-02-14 20:32:26,455 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (exists ((v_ArrVal_38 Int)) (= (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) c_main_~a~0.offset) v_ArrVal_38) (select |c_#memory_int| c_main_~a~0.base))))) is different from false [2022-02-14 20:32:32,857 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-02-14 20:32:39,270 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-02-14 20:33:02,849 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) (not |c_linear_search_#t~short5|)))) is different from false [2022-02-14 20:33:09,330 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (< .cse7 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-02-14 20:33:15,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (< .cse1 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (let ((.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse1 4)) (.cse2 (<= .cse1 2147483647))) (or (and .cse2 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|)) (and (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))) (not .cse2)))))) is different from false [2022-02-14 20:33:22,531 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse1 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse2 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3))) (and (<= 0 .cse1) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (- 17179869184) (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (< .cse1 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse2) (< .cse2 4294967296))))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse4 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse5 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6))) (and (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (<= 0 .cse4) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< .cse4 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse5) (< .cse5 4294967296)))))))) is different from false [2022-02-14 20:33:41,804 WARN L228 SmtUtils]: Spent 12.64s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-02-14 20:33:41,804 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-14 20:33:41,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 153 [2022-02-14 20:34:36,038 WARN L228 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-02-14 20:35:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-02-14 20:35:19,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 20:35:19,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537764603] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 20:35:19,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-14 20:35:19,794 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-02-14 20:35:19,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781157535] [2022-02-14 20:35:19,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-14 20:35:19,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-14 20:35:19,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 20:35:19,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-14 20:35:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=179, Unknown=7, NotChecked=224, Total=462 [2022-02-14 20:35:19,795 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-14 20:35:21,983 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-02-14 20:35:24,262 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (<= (+ 2 (* (div c_~SIZE~0 4294967296) 4294967296)) c_~SIZE~0) (exists ((v_ArrVal_38 Int)) (= (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) c_main_~a~0.offset) v_ArrVal_38) (select |c_#memory_int| c_main_~a~0.base))))) is different from false [2022-02-14 20:35:26,406 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (<= 0 c_linear_search_~j~0) (< .cse0 4294967295) (< 1 .cse0) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-02-14 20:35:28,550 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) (not |c_linear_search_#t~short5|)) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296))))) is different from false [2022-02-14 20:35:30,696 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (< .cse7 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296))))) is different from false [2022-02-14 20:35:32,841 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (<= c_linear_search_~j~0 1) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (not (<= (+ (div c_linear_search_~j~0 4294967296) 1) 0)) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967294 (* (div c_linear_search_~n 4294967296) 4294967296)))))) is different from false [2022-02-14 20:35:34,985 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (not |c_linear_search_#t~short5|))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) .cse1) (or (and (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (<= c_linear_search_~j~0 1)) .cse1))) is different from false [2022-02-14 20:35:37,133 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (<= c_linear_search_~j~0 1) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (< .cse7 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-02-14 20:35:39,275 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 .cse0) (<= c_linear_search_~j~0 1) (< .cse1 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (let ((.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse1 4)) (.cse2 (<= .cse1 2147483647))) (or (and .cse2 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|)) (and (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))) (not .cse2)))))) is different from false [2022-02-14 20:35:41,423 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (< .cse7 4294967295) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))))) is different from false [2022-02-14 20:35:43,570 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< .cse0 4294967295) (< 1 .cse0) (= |c_old(#memory_int)| |c_#memory_int|) (= c_~MAX~0 |c_old(~MAX~0)|) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse1 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse2 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3))) (and (<= 0 .cse1) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (- 17179869184) (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (< .cse1 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse2) (< .cse2 4294967296))))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse4 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse5 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6))) (and (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (<= 0 .cse4) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< .cse4 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse5) (< .cse5 4294967296)))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0))) is different from false [2022-02-14 20:35:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 20:35:43,589 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-14 20:35:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-14 20:35:43,590 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-02-14 20:35:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 20:35:43,591 INFO L225 Difference]: With dead ends: 44 [2022-02-14 20:35:43,591 INFO L226 Difference]: Without dead ends: 40 [2022-02-14 20:35:43,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=106, Invalid=365, Unknown=17, NotChecked=918, Total=1406 [2022-02-14 20:35:43,592 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-14 20:35:43,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 96 Invalid, 1 Unknown, 106 Unchecked, 2.1s Time] [2022-02-14 20:35:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-14 20:35:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-02-14 20:35:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 20:35:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-02-14 20:35:43,596 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2022-02-14 20:35:43,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 20:35:43,596 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-02-14 20:35:43,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-14 20:35:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-14 20:35:43,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-14 20:35:43,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 20:35:43,597 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 20:35:43,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-14 20:35:43,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 20:35:43,799 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 20:35:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 20:35:43,800 INFO L85 PathProgramCache]: Analyzing trace with hash -570649475, now seen corresponding path program 1 times [2022-02-14 20:35:43,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 20:35:43,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757207307] [2022-02-14 20:35:43,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 20:35:43,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 20:35:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:35:43,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 20:35:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:35:43,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-14 20:35:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:35:43,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-14 20:35:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 20:35:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 20:35:43,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 20:35:43,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757207307] [2022-02-14 20:35:43,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757207307] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 20:35:43,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836405078] [2022-02-14 20:35:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 20:35:43,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 20:35:43,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 20:35:43,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 20:35:43,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process