/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/linear_sea.ch.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:35:04,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:35:04,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:35:04,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:35:04,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:35:04,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:35:04,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:35:04,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:35:04,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:35:04,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:35:04,922 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:35:04,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:35:04,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:35:04,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:35:04,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:35:04,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:35:04,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:35:04,957 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:35:04,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:35:04,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:35:04,961 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:35:04,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:35:04,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:35:04,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:35:04,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:35:04,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:35:04,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:35:04,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:35:04,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:35:04,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:35:04,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:35:04,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:35:04,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:35:04,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:35:04,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:35:04,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:35:04,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:35:04,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:35:04,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:35:04,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:35:04,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:35:05,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:35:05,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:35:05,014 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:35:05,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:35:05,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:35:05,019 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:35:05,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:35:05,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:35:05,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:35:05,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:35:05,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:35:05,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:35:05,021 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:35:05,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:35:05,021 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:35:05,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:35:05,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:35:05,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:35:05,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:35:05,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:35:05,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:35:05,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:35:05,021 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:35:05,021 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:35:05,022 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:35:05,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:35:05,022 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:35:05,022 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 03:35:05,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:35:05,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:35:05,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:35:05,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:35:05,363 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:35:05,364 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-08 03:35:05,432 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0c92f2d/69ae5e939f3747df9bbdf93e2fd24a03/FLAG9a797fe9a [2022-04-08 03:35:05,964 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:35:05,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_sea.ch.c [2022-04-08 03:35:05,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0c92f2d/69ae5e939f3747df9bbdf93e2fd24a03/FLAG9a797fe9a [2022-04-08 03:35:06,442 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0c92f2d/69ae5e939f3747df9bbdf93e2fd24a03 [2022-04-08 03:35:06,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:35:06,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:35:06,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:35:06,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:35:06,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:35:06,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:35:06" (1/1) ... [2022-04-08 03:35:06,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ea23dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06, skipping insertion in model container [2022-04-08 03:35:06,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:35:06" (1/1) ... [2022-04-08 03:35:06,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:35:06,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:35:06,715 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-08 03:35:06,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:35:06,786 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:35:06,796 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-08 03:35:06,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:35:06,829 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:35:06,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06 WrapperNode [2022-04-08 03:35:06,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:35:06,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:35:06,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:35:06,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:35:06,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06" (1/1) ... [2022-04-08 03:35:06,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06" (1/1) ... [2022-04-08 03:35:06,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06" (1/1) ... [2022-04-08 03:35:06,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06" (1/1) ... [2022-04-08 03:35:06,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06" (1/1) ... [2022-04-08 03:35:06,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06" (1/1) ... [2022-04-08 03:35:06,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06" (1/1) ... [2022-04-08 03:35:06,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:35:06,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:35:06,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:35:06,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:35:06,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06" (1/1) ... [2022-04-08 03:35:06,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:35:06,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:35:06,967 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-08 03:35:07,063 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-08 03:35:07,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:35:07,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:35:07,090 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:35:07,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:35:07,090 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-08 03:35:07,090 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:35:07,090 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 03:35:07,090 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:35:07,090 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:35:07,090 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:35:07,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:35:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 03:35:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:35:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 03:35:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-08 03:35:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:35:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:35:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 03:35:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 03:35:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:35:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:35:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:35:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:35:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:35:07,159 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:35:07,162 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:35:07,388 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:35:07,393 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:35:07,394 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:35:07,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:35:07 BoogieIcfgContainer [2022-04-08 03:35:07,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:35:07,399 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:35:07,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:35:07,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:35:07,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:35:06" (1/3) ... [2022-04-08 03:35:07,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175dad95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:35:07, skipping insertion in model container [2022-04-08 03:35:07,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:06" (2/3) ... [2022-04-08 03:35:07,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175dad95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:35:07, skipping insertion in model container [2022-04-08 03:35:07,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:35:07" (3/3) ... [2022-04-08 03:35:07,406 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.c [2022-04-08 03:35:07,418 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:35:07,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:35:07,496 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:35:07,508 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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-08 03:35:07,509 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:35:07,545 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-08 03:35:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 03:35:07,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:07,550 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-08 03:35:07,551 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:07,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1307815669, now seen corresponding path program 1 times [2022-04-08 03:35:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:07,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [840038310] [2022-04-08 03:35:07,594 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:35:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1307815669, now seen corresponding path program 2 times [2022-04-08 03:35:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:07,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085682512] [2022-04-08 03:35:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:07,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:07,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:07,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {36#true} is VALID [2022-04-08 03:35:07,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 03:35:07,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #66#return; {36#true} is VALID [2022-04-08 03:35:07,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-08 03:35:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:08,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {36#true} is VALID [2022-04-08 03:35:08,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 03:35:08,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #60#return; {36#true} is VALID [2022-04-08 03:35:08,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 03:35:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:08,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {36#true} is VALID [2022-04-08 03:35:08,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-04-08 03:35:08,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {37#false} is VALID [2022-04-08 03:35:08,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 03:35:08,039 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {37#false} {36#true} #62#return; {37#false} is VALID [2022-04-08 03:35:08,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:35:08,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {36#true} is VALID [2022-04-08 03:35:08,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 03:35:08,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #66#return; {36#true} is VALID [2022-04-08 03:35:08,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret10 := main(); {36#true} is VALID [2022-04-08 03:35:08,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {36#true} is VALID [2022-04-08 03:35:08,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {36#true} is VALID [2022-04-08 03:35:08,044 INFO L272 TraceCheckUtils]: 7: Hoare triple {36#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {50#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-08 03:35:08,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {50#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {36#true} is VALID [2022-04-08 03:35:08,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-08 03:35:08,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#true} {36#true} #60#return; {36#true} is VALID [2022-04-08 03:35:08,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {36#true} is VALID [2022-04-08 03:35:08,045 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {36#true} is VALID [2022-04-08 03:35:08,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {36#true} is VALID [2022-04-08 03:35:08,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-04-08 03:35:08,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {37#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {37#false} is VALID [2022-04-08 03:35:08,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-08 03:35:08,046 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37#false} {36#true} #62#return; {37#false} is VALID [2022-04-08 03:35:08,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {37#false} is VALID [2022-04-08 03:35:08,047 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert(#t~ret9); {37#false} is VALID [2022-04-08 03:35:08,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-08 03:35:08,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-08 03:35:08,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-08 03:35:08,048 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-08 03:35:08,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:08,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085682512] [2022-04-08 03:35:08,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085682512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:08,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:08,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:35:08,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:08,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [840038310] [2022-04-08 03:35:08,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [840038310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:08,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:08,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:35:08,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320283523] [2022-04-08 03:35:08,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:08,072 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-08 03:35:08,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:08,076 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-08 03:35:08,125 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-08 03:35:08,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:35:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:08,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:35:08,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:35:08,162 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-08 03:35:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:08,439 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-08 03:35:08,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:35:08,439 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-08 03:35:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:08,443 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-08 03:35:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-08 03:35:08,468 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-08 03:35:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-04-08 03:35:08,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-04-08 03:35:08,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:08,582 INFO L225 Difference]: With dead ends: 51 [2022-04-08 03:35:08,583 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 03:35:08,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:35:08,603 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-08 03:35:08,606 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-08 03:35:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 03:35:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 03:35:08,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:08,674 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-08 03:35:08,675 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-08 03:35:08,675 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-08 03:35:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:08,681 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-08 03:35:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-08 03:35:08,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:08,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:08,682 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-08 03:35:08,683 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-08 03:35:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:08,701 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-08 03:35:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-08 03:35:08,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:08,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:08,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:08,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:08,703 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-08 03:35:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-08 03:35:08,705 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-04-08 03:35:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:08,706 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-08 03:35:08,706 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-08 03:35:08,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-08 03:35:08,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:08,734 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-08 03:35:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 03:35:08,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:08,735 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-08 03:35:08,735 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:35:08,737 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:08,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:08,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1795654780, now seen corresponding path program 1 times [2022-04-08 03:35:08,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:08,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2106089734] [2022-04-08 03:35:08,740 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:35:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1795654780, now seen corresponding path program 2 times [2022-04-08 03:35:08,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:08,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688515378] [2022-04-08 03:35:08,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:08,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:08,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {280#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {262#true} is VALID [2022-04-08 03:35:08,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:35:08,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #66#return; {262#true} is VALID [2022-04-08 03:35:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-08 03:35:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:08,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {262#true} is VALID [2022-04-08 03:35:08,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:35:08,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #60#return; {262#true} is VALID [2022-04-08 03:35:08,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 03:35:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:09,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {262#true} is VALID [2022-04-08 03:35:09,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {262#true} is VALID [2022-04-08 03:35:09,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {262#true} is VALID [2022-04-08 03:35:09,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {262#true} is VALID [2022-04-08 03:35:09,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {262#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-08 03:35:09,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-08 03:35:09,087 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {262#true} #62#return; {277#(= |main_#t~ret9| 1)} is VALID [2022-04-08 03:35:09,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {280#(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-08 03:35:09,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {262#true} is VALID [2022-04-08 03:35:09,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:35:09,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #66#return; {262#true} is VALID [2022-04-08 03:35:09,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret10 := main(); {262#true} is VALID [2022-04-08 03:35:09,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {262#true} is VALID [2022-04-08 03:35:09,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {262#true} is VALID [2022-04-08 03:35:09,093 INFO L272 TraceCheckUtils]: 7: Hoare triple {262#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {281#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-08 03:35:09,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {262#true} is VALID [2022-04-08 03:35:09,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 03:35:09,093 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {262#true} {262#true} #60#return; {262#true} is VALID [2022-04-08 03:35:09,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {262#true} is VALID [2022-04-08 03:35:09,094 INFO L272 TraceCheckUtils]: 12: Hoare triple {262#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {262#true} is VALID [2022-04-08 03:35:09,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {262#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {262#true} is VALID [2022-04-08 03:35:09,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {262#true} is VALID [2022-04-08 03:35:09,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#true} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {262#true} is VALID [2022-04-08 03:35:09,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {262#true} is VALID [2022-04-08 03:35:09,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {262#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-08 03:35:09,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-08 03:35:09,097 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {282#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {262#true} #62#return; {277#(= |main_#t~ret9| 1)} is VALID [2022-04-08 03:35:09,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {277#(= |main_#t~ret9| 1)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {277#(= |main_#t~ret9| 1)} is VALID [2022-04-08 03:35:09,098 INFO L272 TraceCheckUtils]: 21: Hoare triple {277#(= |main_#t~ret9| 1)} call __VERIFIER_assert(#t~ret9); {278#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-08 03:35:09,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {278#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {279#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-08 03:35:09,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {279#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {263#false} is VALID [2022-04-08 03:35:09,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 03:35:09,099 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-08 03:35:09,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:09,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688515378] [2022-04-08 03:35:09,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688515378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:09,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:09,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:35:09,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:09,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2106089734] [2022-04-08 03:35:09,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2106089734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:09,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:09,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:35:09,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804071974] [2022-04-08 03:35:09,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:09,102 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-08 03:35:09,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:09,103 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-08 03:35:09,124 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-08 03:35:09,124 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:35:09,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:09,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:35:09,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:35:09,125 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-08 03:35:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:09,717 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-08 03:35:09,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:35:09,718 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-08 03:35:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:09,718 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-08 03:35:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-08 03:35:09,719 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-08 03:35:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-08 03:35:09,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-08 03:35:09,781 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-08 03:35:09,782 INFO L225 Difference]: With dead ends: 34 [2022-04-08 03:35:09,783 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 03:35:09,783 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-08 03:35:09,785 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:09,790 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.3s Time] [2022-04-08 03:35:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 03:35:09,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 03:35:09,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:09,811 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-08 03:35:09,812 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-08 03:35:09,813 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-08 03:35:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:09,815 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-08 03:35:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-08 03:35:09,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:09,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:09,816 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-08 03:35:09,816 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-08 03:35:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:09,817 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-08 03:35:09,818 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-08 03:35:09,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:09,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:09,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:09,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:09,818 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-08 03:35:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-04-08 03:35:09,824 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2022-04-08 03:35:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:09,824 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-04-08 03:35:09,824 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-08 03:35:09,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2022-04-08 03:35:09,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:09,861 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-08 03:35:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 03:35:09,862 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:09,862 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-08 03:35:09,862 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:35:09,863 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash -52844445, now seen corresponding path program 1 times [2022-04-08 03:35:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:09,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294682077] [2022-04-08 03:35:09,864 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:35:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash -52844445, now seen corresponding path program 2 times [2022-04-08 03:35:09,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:35:09,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395731622] [2022-04-08 03:35:09,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:35:09,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:35:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:09,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:35:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {482#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {466#true} is VALID [2022-04-08 03:35:10,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 03:35:10,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #66#return; {466#true} is VALID [2022-04-08 03:35:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-08 03:35:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {466#true} is VALID [2022-04-08 03:35:10,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 03:35:10,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #60#return; {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-08 03:35:10,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 03:35:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:35:10,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {466#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:10,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {485#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-08 03:35:10,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:10,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:10,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-08 03:35:10,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-08 03:35:10,182 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #62#return; {467#false} is VALID [2022-04-08 03:35:10,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {482#(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-08 03:35:10,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {466#true} is VALID [2022-04-08 03:35:10,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 03:35:10,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #66#return; {466#true} is VALID [2022-04-08 03:35:10,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret10 := main(); {466#true} is VALID [2022-04-08 03:35:10,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 8 then 1 + #t~nondet7 % 4294967296 / 8 else #t~nondet7 % 4294967296 / 8);havoc #t~nondet7; {466#true} is VALID [2022-04-08 03:35:10,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-08 03:35:10,185 INFO L272 TraceCheckUtils]: 7: Hoare triple {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {483#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-08 03:35:10,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {466#true} is VALID [2022-04-08 03:35:10,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-08 03:35:10,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {466#true} {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #60#return; {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-08 03:35:10,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-08 03:35:10,187 INFO L272 TraceCheckUtils]: 12: Hoare triple {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {466#true} is VALID [2022-04-08 03:35:10,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {466#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:10,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {485#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-08 03:35:10,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {485#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:10,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:35:10,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {484#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-08 03:35:10,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-08 03:35:10,193 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {486#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {471#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #62#return; {467#false} is VALID [2022-04-08 03:35:10,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {467#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {467#false} is VALID [2022-04-08 03:35:10,193 INFO L272 TraceCheckUtils]: 21: Hoare triple {467#false} call __VERIFIER_assert(#t~ret9); {467#false} is VALID [2022-04-08 03:35:10,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {467#false} ~cond := #in~cond; {467#false} is VALID [2022-04-08 03:35:10,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {467#false} assume 0 == ~cond; {467#false} is VALID [2022-04-08 03:35:10,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-08 03:35:10,194 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-08 03:35:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:35:10,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395731622] [2022-04-08 03:35:10,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395731622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:10,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:10,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:35:10,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:35:10,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294682077] [2022-04-08 03:35:10,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294682077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:35:10,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:35:10,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:35:10,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106685293] [2022-04-08 03:35:10,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:35:10,195 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-08 03:35:10,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:35:10,196 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-08 03:35:10,234 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-08 03:35:10,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:35:10,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:10,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:35:10,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:35:10,236 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-08 03:35:14,654 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-08 03:35:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:15,340 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-08 03:35:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 03:35:15,340 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-08 03:35:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:35:15,340 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-08 03:35:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2022-04-08 03:35:15,342 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-08 03:35:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2022-04-08 03:35:15,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2022-04-08 03:35:15,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:15,416 INFO L225 Difference]: With dead ends: 39 [2022-04-08 03:35:15,416 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 03:35:15,416 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-08 03:35:15,417 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 60 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:35:15,417 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 29 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 03:35:15,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 03:35:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-08 03:35:15,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:35:15,445 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-08 03:35:15,445 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-08 03:35:15,446 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-08 03:35:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:15,448 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-08 03:35:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-08 03:35:15,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:15,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:15,448 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-08 03:35:15,449 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-08 03:35:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:35:15,450 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-08 03:35:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-08 03:35:15,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:35:15,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:35:15,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:35:15,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:35:15,451 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-08 03:35:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-08 03:35:15,452 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-08 03:35:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:35:15,454 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-08 03:35:15,455 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-08 03:35:15,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-08 03:35:15,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:35:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-08 03:35:15,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 03:35:15,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:35:15,513 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-08 03:35:15,513 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 03:35:15,513 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:35:15,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:35:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -238208460, now seen corresponding path program 1 times [2022-04-08 03:35:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:35:15,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [887958642] [2022-04-08 03:35:20,694 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 03:35:24,737 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 03:35:27,307 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:35:27,312 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_linear_search_#t~post6_4|, |v_linear_search_#t~mem4_6|, |v_linear_search_#t~short5_16|] at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 03:35:27,319 INFO L158 Benchmark]: Toolchain (without parser) took 20866.88ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 119.8MB in the beginning and 144.1MB in the end (delta: -24.3MB). Peak memory consumption was 88.9MB. Max. memory is 8.0GB. [2022-04-08 03:35:27,321 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:35:27,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.71ms. Allocated memory is still 170.9MB. Free memory was 150.5MB in the beginning and 146.5MB in the end (delta: 4.1MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2022-04-08 03:35:27,328 INFO L158 Benchmark]: Boogie Preprocessor took 46.74ms. Allocated memory is still 170.9MB. Free memory was 146.5MB in the beginning and 144.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:35:27,328 INFO L158 Benchmark]: RCFGBuilder took 508.93ms. Allocated memory is still 170.9MB. Free memory was 144.8MB in the beginning and 131.6MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 03:35:27,328 INFO L158 Benchmark]: TraceAbstraction took 19919.28ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 131.2MB in the beginning and 144.1MB in the end (delta: -12.9MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. [2022-04-08 03:35:27,329 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 371.71ms. Allocated memory is still 170.9MB. Free memory was 150.5MB in the beginning and 146.5MB in the end (delta: 4.1MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.74ms. Allocated memory is still 170.9MB. Free memory was 146.5MB in the beginning and 144.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 508.93ms. Allocated memory is still 170.9MB. Free memory was 144.8MB in the beginning and 131.6MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 19919.28ms. Allocated memory was 170.9MB in the beginning and 205.5MB in the end (delta: 34.6MB). Free memory was 131.2MB in the beginning and 144.1MB in the end (delta: -12.9MB). Peak memory consumption was 100.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_linear_search_#t~post6_4|, |v_linear_search_#t~mem4_6|, |v_linear_search_#t~short5_16|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_linear_search_#t~post6_4|, |v_linear_search_#t~mem4_6|, |v_linear_search_#t~short5_16|]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 03:35:27,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...