/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-memory-linkedlists/ll_search_not_found-alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:59:15,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:59:15,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:59:15,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:59:15,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:59:15,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:59:15,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:59:15,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:59:15,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:59:15,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:59:15,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:59:15,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:59:15,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:59:15,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:59:15,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:59:15,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:59:15,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:59:15,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:59:15,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:59:15,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:59:15,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:59:15,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:59:15,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:59:15,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:59:15,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:59:15,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:59:15,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:59:15,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:59:15,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:59:15,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:59:15,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:59:15,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:59:15,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:59:15,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:59:15,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:59:15,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:59:15,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:59:15,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:59:15,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:59:15,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:59:15,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:59:15,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:59:15,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:59:15,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:59:15,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:59:15,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:59:15,893 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:59:15,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:59:15,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:59:15,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:59:15,897 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:59:15,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:59:15,898 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:59:15,898 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:59:15,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:59:15,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:59:15,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:59:15,899 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:59:15,899 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:59:15,899 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:59:15,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:59:15,900 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:59:15,900 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:59:15,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:59:15,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:59:15,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:59:15,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:59:15,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:59:15,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:59:15,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:59:15,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:59:15,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:59:15,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 17:59:16,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:59:16,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:59:16,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:59:16,347 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:59:16,348 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:59:16,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/ll_search_not_found-alloca.i [2022-10-15 17:59:16,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f3ea071/05d10e25d033414f9035b45c680426b2/FLAG63d14ece9 [2022-10-15 17:59:17,247 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:59:17,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_search_not_found-alloca.i [2022-10-15 17:59:17,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f3ea071/05d10e25d033414f9035b45c680426b2/FLAG63d14ece9 [2022-10-15 17:59:17,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05f3ea071/05d10e25d033414f9035b45c680426b2 [2022-10-15 17:59:17,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:59:17,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:59:17,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:59:17,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:59:17,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:59:17,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:59:17" (1/1) ... [2022-10-15 17:59:17,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2558d252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:17, skipping insertion in model container [2022-10-15 17:59:17,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:59:17" (1/1) ... [2022-10-15 17:59:17,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:59:17,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:59:17,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:59:17,940 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:59:18,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:59:18,079 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:59:18,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18 WrapperNode [2022-10-15 17:59:18,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:59:18,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:59:18,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:59:18,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:59:18,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,175 INFO L138 Inliner]: procedures = 114, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2022-10-15 17:59:18,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:59:18,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:59:18,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:59:18,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:59:18,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,237 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:59:18,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:59:18,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:59:18,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:59:18,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (1/1) ... [2022-10-15 17:59:18,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:59:18,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:59:18,287 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-10-15 17:59:18,306 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-10-15 17:59:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:59:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:59:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 17:59:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 17:59:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 17:59:18,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:59:18,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:59:18,445 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:59:18,448 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:59:18,700 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:59:18,715 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:59:18,716 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:59:18,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:59:18 BoogieIcfgContainer [2022-10-15 17:59:18,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:59:18,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:59:18,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:59:18,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:59:18,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:59:17" (1/3) ... [2022-10-15 17:59:18,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c319a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:59:18, skipping insertion in model container [2022-10-15 17:59:18,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:18" (2/3) ... [2022-10-15 17:59:18,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c319a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:59:18, skipping insertion in model container [2022-10-15 17:59:18,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:59:18" (3/3) ... [2022-10-15 17:59:18,731 INFO L112 eAbstractionObserver]: Analyzing ICFG ll_search_not_found-alloca.i [2022-10-15 17:59:18,756 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:59:18,756 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-10-15 17:59:18,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:59:18,824 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1cba1207, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:59:18,824 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-10-15 17:59:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.736842105263158) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:59:18,837 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:18,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:59:18,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-10-15 17:59:18,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:18,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562174472] [2022-10-15 17:59:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:19,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:19,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562174472] [2022-10-15 17:59:19,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562174472] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:19,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:19,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434869714] [2022-10-15 17:59:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:19,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:19,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:19,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:19,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:19,238 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.736842105263158) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:19,341 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-10-15 17:59:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:19,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:59:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:19,353 INFO L225 Difference]: With dead ends: 46 [2022-10-15 17:59:19,354 INFO L226 Difference]: Without dead ends: 42 [2022-10-15 17:59:19,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:19,364 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 26 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:19,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 52 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-15 17:59:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 25. [2022-10-15 17:59:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-10-15 17:59:19,410 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 4 [2022-10-15 17:59:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:19,411 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-10-15 17:59:19,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-10-15 17:59:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:59:19,412 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:19,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:59:19,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:59:19,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:19,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-10-15 17:59:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:19,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667770201] [2022-10-15 17:59:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:19,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:19,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667770201] [2022-10-15 17:59:19,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667770201] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:19,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:19,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:19,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988884770] [2022-10-15 17:59:19,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:19,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:19,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:19,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:19,583 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:19,615 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-10-15 17:59:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:19,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:59:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:19,617 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:59:19,617 INFO L226 Difference]: Without dead ends: 40 [2022-10-15 17:59:19,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:19,620 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:19,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-15 17:59:19,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2022-10-15 17:59:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-10-15 17:59:19,626 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 4 [2022-10-15 17:59:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:19,627 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-10-15 17:59:19,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:19,628 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-10-15 17:59:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 17:59:19,628 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:19,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:19,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:59:19,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:19,630 INFO L85 PathProgramCache]: Analyzing trace with hash 218601753, now seen corresponding path program 1 times [2022-10-15 17:59:19,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:19,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823126656] [2022-10-15 17:59:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:19,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:19,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823126656] [2022-10-15 17:59:19,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823126656] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:19,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:19,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:59:19,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230273213] [2022-10-15 17:59:19,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:19,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:59:19,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:19,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:59:19,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:59:19,860 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:20,031 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-10-15 17:59:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:59:20,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 17:59:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:20,036 INFO L225 Difference]: With dead ends: 36 [2022-10-15 17:59:20,037 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:59:20,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:59:20,041 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:20,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:59:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-10-15 17:59:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-10-15 17:59:20,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 8 [2022-10-15 17:59:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:20,062 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-10-15 17:59:20,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-10-15 17:59:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:59:20,063 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:20,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:20,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:59:20,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:20,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:20,071 INFO L85 PathProgramCache]: Analyzing trace with hash -376924739, now seen corresponding path program 1 times [2022-10-15 17:59:20,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:20,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148319479] [2022-10-15 17:59:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:20,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148319479] [2022-10-15 17:59:20,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148319479] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:20,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:20,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704237654] [2022-10-15 17:59:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:20,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:20,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:20,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:20,154 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:20,193 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-10-15 17:59:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:20,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 17:59:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:20,194 INFO L225 Difference]: With dead ends: 32 [2022-10-15 17:59:20,195 INFO L226 Difference]: Without dead ends: 25 [2022-10-15 17:59:20,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:20,197 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:20,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-10-15 17:59:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-10-15 17:59:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-10-15 17:59:20,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2022-10-15 17:59:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:20,208 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-10-15 17:59:20,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-10-15 17:59:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:59:20,210 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:20,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:20,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:59:20,211 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:20,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1058476674, now seen corresponding path program 1 times [2022-10-15 17:59:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:20,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961955315] [2022-10-15 17:59:20,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:20,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:20,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:20,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961955315] [2022-10-15 17:59:20,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961955315] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:20,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:20,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:59:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327457224] [2022-10-15 17:59:20,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:20,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:59:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:59:20,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:59:20,465 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:20,573 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-10-15 17:59:20,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:59:20,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 17:59:20,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:20,574 INFO L225 Difference]: With dead ends: 35 [2022-10-15 17:59:20,574 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 17:59:20,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:59:20,577 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:20,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 20 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 17:59:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-10-15 17:59:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-10-15 17:59:20,591 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 13 [2022-10-15 17:59:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:20,592 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-10-15 17:59:20,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-10-15 17:59:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:59:20,594 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:20,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:20,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:59:20,594 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:20,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1058476675, now seen corresponding path program 1 times [2022-10-15 17:59:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:20,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358527235] [2022-10-15 17:59:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:20,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:20,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358527235] [2022-10-15 17:59:20,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358527235] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:20,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:20,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:59:20,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939120399] [2022-10-15 17:59:20,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:20,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:59:20,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:20,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:59:20,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:59:20,869 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:21,004 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-10-15 17:59:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:59:21,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 17:59:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:21,006 INFO L225 Difference]: With dead ends: 38 [2022-10-15 17:59:21,007 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:59:21,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:59:21,011 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 93 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:21,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 30 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:59:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-10-15 17:59:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-10-15 17:59:21,029 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2022-10-15 17:59:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:21,030 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-10-15 17:59:21,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,030 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-10-15 17:59:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:59:21,031 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:21,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:21,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:59:21,034 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:21,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash -710977306, now seen corresponding path program 1 times [2022-10-15 17:59:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:21,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856248382] [2022-10-15 17:59:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:21,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:21,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856248382] [2022-10-15 17:59:21,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856248382] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:21,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:21,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:59:21,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129694584] [2022-10-15 17:59:21,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:21,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:59:21,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:21,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:59:21,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:59:21,168 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:21,274 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-10-15 17:59:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:59:21,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 17:59:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:21,276 INFO L225 Difference]: With dead ends: 37 [2022-10-15 17:59:21,276 INFO L226 Difference]: Without dead ends: 37 [2022-10-15 17:59:21,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:59:21,277 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 97 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:21,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 47 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-10-15 17:59:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-10-15 17:59:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-10-15 17:59:21,282 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2022-10-15 17:59:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:21,283 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-10-15 17:59:21,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-10-15 17:59:21,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 17:59:21,284 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:21,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:21,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:59:21,284 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:21,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:21,285 INFO L85 PathProgramCache]: Analyzing trace with hash -529964087, now seen corresponding path program 1 times [2022-10-15 17:59:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:21,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039727013] [2022-10-15 17:59:21,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:59:21,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:59:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:59:21,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:59:21,343 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:59:21,345 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2022-10-15 17:59:21,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2022-10-15 17:59:21,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2022-10-15 17:59:21,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2022-10-15 17:59:21,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2022-10-15 17:59:21,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2022-10-15 17:59:21,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2022-10-15 17:59:21,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2022-10-15 17:59:21,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2022-10-15 17:59:21,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:59:21,353 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:21,357 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:59:21,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:59:21 BoogieIcfgContainer [2022-10-15 17:59:21,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:59:21,404 INFO L158 Benchmark]: Toolchain (without parser) took 3978.84ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 132.0MB in the beginning and 135.9MB in the end (delta: -3.9MB). Peak memory consumption was 30.1MB. Max. memory is 8.0GB. [2022-10-15 17:59:21,405 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 159.4MB. Free memory was 133.4MB in the beginning and 133.2MB in the end (delta: 142.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:59:21,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.97ms. Allocated memory is still 159.4MB. Free memory was 131.9MB in the beginning and 116.5MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 17:59:21,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.07ms. Allocated memory is still 159.4MB. Free memory was 116.5MB in the beginning and 114.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:59:21,406 INFO L158 Benchmark]: Boogie Preprocessor took 68.08ms. Allocated memory is still 159.4MB. Free memory was 114.6MB in the beginning and 113.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:59:21,407 INFO L158 Benchmark]: RCFGBuilder took 472.82ms. Allocated memory is still 159.4MB. Free memory was 113.3MB in the beginning and 100.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 17:59:21,407 INFO L158 Benchmark]: TraceAbstraction took 2681.11ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 100.1MB in the beginning and 135.9MB in the end (delta: -35.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:59:21,410 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 159.4MB. Free memory was 133.4MB in the beginning and 133.2MB in the end (delta: 142.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 644.97ms. Allocated memory is still 159.4MB. Free memory was 131.9MB in the beginning and 116.5MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 96.07ms. Allocated memory is still 159.4MB. Free memory was 116.5MB in the beginning and 114.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.08ms. Allocated memory is still 159.4MB. Free memory was 114.6MB in the beginning and 113.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 472.82ms. Allocated memory is still 159.4MB. Free memory was 113.3MB in the beginning and 100.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2681.11ms. Allocated memory was 159.4MB in the beginning and 191.9MB in the end (delta: 32.5MB). Free memory was 100.1MB in the beginning and 135.9MB in the end (delta: -35.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 565. Possible FailurePath: [L567] int n = __VERIFIER_nondet_int(); [L568] CALL, EXPR init_ll(n) [L548] node_t* head = ((void *)0); [L549] node_t* curr; [L550] int i = 0; VAL [\old(n)=1, head={0:0}, i=0, n=1] [L550] COND TRUE i < n [L551] curr = malloc(sizeof(node_t)) [L552] curr->val = i VAL [\old(n)=1, curr={-1:0}, head={0:0}, i=0, n=1] [L553] curr->next = head VAL [\old(n)=1, curr={-1:0}, head={0:0}, i=0, n=1] [L554] head = curr VAL [\old(n)=1, curr={-1:0}, head={-1:0}, i=0, n=1] [L550] i++ VAL [\old(n)=1, curr={-1:0}, head={-1:0}, i=1, n=1] [L550] COND FALSE !(i < n) VAL [\old(n)=1, curr={-1:0}, head={-1:0}, i=1, n=1] [L556] return head; VAL [\old(n)=1, \result={-1:0}, curr={-1:0}, head={-1:0}, i=1, n=1] [L568] RET, EXPR init_ll(n) [L568] node_t* head = init_ll(n); [L569] CALL safe_search(head, __VERIFIER_nondet_int()) [L560] node_t* curr = head; VAL [\old(i)=0, curr={-1:0}, head={-1:0}, head={-1:0}, i=0] [L561] curr != ((void *)0) && curr->val != i VAL [\old(i)=0, curr={-1:0}, curr != ((void *)0) && curr->val != i=1, head={-1:0}, head={-1:0}, i=0] [L561] EXPR curr->val VAL [\old(i)=0, curr={-1:0}, curr != ((void *)0) && curr->val != i=1, curr->val=0, head={-1:0}, head={-1:0}, i=0] [L561] curr != ((void *)0) && curr->val != i VAL [\old(i)=0, curr={-1:0}, curr != ((void *)0) && curr->val != i=0, curr->val=0, head={-1:0}, head={-1:0}, i=0] [L561] COND FALSE !(curr != ((void *)0) && curr->val != i) [L569] RET safe_search(head, __VERIFIER_nondet_int()) [L570] return 0; VAL [\result=0, head={-1:0}, n=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 222 IncrementalHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 159 mSDtfsCounter, 222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 64 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 17:59:21,468 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...