/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/array-tiling/mlceu2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:27:52,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:27:52,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:27:52,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:27:52,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:27:52,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:27:52,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:27:52,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:27:52,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:27:52,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:27:52,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:27:52,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:27:52,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:27:52,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:27:52,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:27:52,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:27:52,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:27:52,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:27:52,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:27:52,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:27:52,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:27:52,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:27:52,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:27:52,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:27:52,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:27:52,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:27:52,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:27:52,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:27:52,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:27:52,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:27:52,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:27:52,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:27:52,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:27:52,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:27:52,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:27:52,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:27:52,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:27:52,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:27:52,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:27:52,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:27:52,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:27:52,268 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 16:27:52,326 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:27:52,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:27:52,328 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:27:52,328 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:27:52,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:27:52,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:27:52,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:27:52,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:27:52,334 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:27:52,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:27:52,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:27:52,336 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:27:52,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:27:52,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:27:52,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:27:52,337 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:27:52,337 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:27:52,337 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:27:52,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:27:52,338 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:27:52,338 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:27:52,338 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:27:52,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:27:52,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:27:52,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:27:52,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:27:52,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:27:52,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:27:52,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:27:52,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:27:52,340 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 16:27:52,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:27:52,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:27:52,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:27:52,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:27:52,775 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:27:52,776 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mlceu2.c [2022-10-15 16:27:52,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3050e837c/1f5696049f29412a880278822f0c56bf/FLAGfbe6e7cbe [2022-10-15 16:27:53,486 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:27:53,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mlceu2.c [2022-10-15 16:27:53,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3050e837c/1f5696049f29412a880278822f0c56bf/FLAGfbe6e7cbe [2022-10-15 16:27:53,846 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3050e837c/1f5696049f29412a880278822f0c56bf [2022-10-15 16:27:53,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:27:53,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:27:53,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:27:53,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:27:53,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:27:53,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:27:53" (1/1) ... [2022-10-15 16:27:53,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30df5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:53, skipping insertion in model container [2022-10-15 16:27:53,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:27:53" (1/1) ... [2022-10-15 16:27:53,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:27:53,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:27:54,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mlceu2.c[397,410] [2022-10-15 16:27:54,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:27:54,248 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:27:54,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mlceu2.c[397,410] [2022-10-15 16:27:54,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:27:54,321 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:27:54,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54 WrapperNode [2022-10-15 16:27:54,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:27:54,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:27:54,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:27:54,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:27:54,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,381 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-10-15 16:27:54,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:27:54,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:27:54,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:27:54,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:27:54,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,442 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:27:54,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:27:54,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:27:54,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:27:54,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (1/1) ... [2022-10-15 16:27:54,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:27:54,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:27:54,498 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 16:27:54,525 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 16:27:54,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:27:54,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:27:54,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:27:54,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:27:54,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:27:54,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:27:54,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:27:54,702 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:27:54,704 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:27:55,043 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:27:55,058 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:27:55,062 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 16:27:55,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:27:55 BoogieIcfgContainer [2022-10-15 16:27:55,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:27:55,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:27:55,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:27:55,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:27:55,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:27:53" (1/3) ... [2022-10-15 16:27:55,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dabd73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:27:55, skipping insertion in model container [2022-10-15 16:27:55,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:27:54" (2/3) ... [2022-10-15 16:27:55,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dabd73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:27:55, skipping insertion in model container [2022-10-15 16:27:55,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:27:55" (3/3) ... [2022-10-15 16:27:55,093 INFO L112 eAbstractionObserver]: Analyzing ICFG mlceu2.c [2022-10-15 16:27:55,122 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:27:55,122 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-15 16:27:55,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:27:55,224 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;@1f48fea9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:27:55,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-15 16:27:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 27 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 16:27:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:27:55,239 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:55,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:27:55,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:55,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash 28747386, now seen corresponding path program 1 times [2022-10-15 16:27:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:55,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592918302] [2022-10-15 16:27:55,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:55,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:55,513 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 16:27:55,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:27:55,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592918302] [2022-10-15 16:27:55,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592918302] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:27:55,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:27:55,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:27:55,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519441444] [2022-10-15 16:27:55,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:27:55,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:27:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:27:55,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:27:55,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:27:55,564 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 27 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 16:27:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:27:55,631 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-10-15 16:27:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:27:55,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-10-15 16:27:55,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:27:55,658 INFO L225 Difference]: With dead ends: 30 [2022-10-15 16:27:55,658 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 16:27:55,661 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 16:27:55,670 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:27:55,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:27:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 16:27:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-15 16:27:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 25 states have internal predecessors, (28), 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 16:27:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-10-15 16:27:55,725 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 5 [2022-10-15 16:27:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:27:55,725 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-10-15 16:27:55,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 16:27:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-10-15 16:27:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:27:55,728 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:55,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:27:55,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:27:55,731 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash 889512685, now seen corresponding path program 1 times [2022-10-15 16:27:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:55,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306324488] [2022-10-15 16:27:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:55,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:55,955 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 16:27:55,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:27:55,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306324488] [2022-10-15 16:27:55,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306324488] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:27:55,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:27:55,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:27:55,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846232242] [2022-10-15 16:27:55,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:27:55,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:27:55,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:27:55,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:27:55,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:27:55,964 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 16:27:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:27:56,053 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-10-15 16:27:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:27:56,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-10-15 16:27:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:27:56,057 INFO L225 Difference]: With dead ends: 46 [2022-10-15 16:27:56,057 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 16:27:56,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 16:27:56,059 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:27:56,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 28 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:27:56,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 16:27:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2022-10-15 16:27:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.55) internal successors, (31), 27 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 16:27:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-10-15 16:27:56,068 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 6 [2022-10-15 16:27:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:27:56,069 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-10-15 16:27:56,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 16:27:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-10-15 16:27:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:27:56,070 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:56,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:27:56,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:27:56,071 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:56,071 INFO L85 PathProgramCache]: Analyzing trace with hash 889512845, now seen corresponding path program 1 times [2022-10-15 16:27:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:56,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130217066] [2022-10-15 16:27:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:56,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:56,161 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 16:27:56,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:27:56,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130217066] [2022-10-15 16:27:56,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130217066] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:27:56,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:27:56,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:27:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878195183] [2022-10-15 16:27:56,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:27:56,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:27:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:27:56,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:27:56,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:27:56,165 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 16:27:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:27:56,186 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-10-15 16:27:56,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:27:56,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-10-15 16:27:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:27:56,188 INFO L225 Difference]: With dead ends: 25 [2022-10-15 16:27:56,188 INFO L226 Difference]: Without dead ends: 25 [2022-10-15 16:27:56,188 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 16:27:56,190 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:27:56,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:27:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-10-15 16:27:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-10-15 16:27:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 24 states have internal predecessors, (28), 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 16:27:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-10-15 16:27:56,196 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 6 [2022-10-15 16:27:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:27:56,197 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-10-15 16:27:56,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 16:27:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-10-15 16:27:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:27:56,198 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:56,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:27:56,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:27:56,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash 889512846, now seen corresponding path program 1 times [2022-10-15 16:27:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:56,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460089718] [2022-10-15 16:27:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:56,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:56,334 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 16:27:56,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:27:56,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460089718] [2022-10-15 16:27:56,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460089718] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:27:56,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:27:56,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:27:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890110748] [2022-10-15 16:27:56,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:27:56,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:27:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:27:56,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:27:56,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:27:56,337 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 16:27:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:27:56,399 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-10-15 16:27:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:27:56,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-10-15 16:27:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:27:56,403 INFO L225 Difference]: With dead ends: 39 [2022-10-15 16:27:56,403 INFO L226 Difference]: Without dead ends: 39 [2022-10-15 16:27:56,404 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 16:27:56,409 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:27:56,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:27:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-15 16:27:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-10-15 16:27:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) 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 16:27:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-10-15 16:27:56,426 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 6 [2022-10-15 16:27:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:27:56,427 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-10-15 16:27:56,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 16:27:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-10-15 16:27:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:27:56,428 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:56,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:27:56,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:27:56,430 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash 121787665, now seen corresponding path program 1 times [2022-10-15 16:27:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:56,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078402026] [2022-10-15 16:27:56,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:56,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:56,552 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 16:27:56,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:27:56,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078402026] [2022-10-15 16:27:56,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078402026] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:27:56,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:27:56,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:27:56,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786317739] [2022-10-15 16:27:56,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:27:56,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:27:56,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:27:56,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:27:56,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:27:56,556 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 16:27:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:27:56,620 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-10-15 16:27:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:27:56,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 16:27:56,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:27:56,622 INFO L225 Difference]: With dead ends: 27 [2022-10-15 16:27:56,622 INFO L226 Difference]: Without dead ends: 27 [2022-10-15 16:27:56,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 16:27:56,625 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:27:56,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:27:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-15 16:27:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-10-15 16:27:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 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 16:27:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-10-15 16:27:56,639 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 8 [2022-10-15 16:27:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:27:56,641 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-10-15 16:27:56,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 16:27:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-10-15 16:27:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:27:56,643 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:56,644 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:27:56,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:27:56,644 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:56,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1717812734, now seen corresponding path program 1 times [2022-10-15 16:27:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:56,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851229558] [2022-10-15 16:27:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:56,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:56,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:27:56,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851229558] [2022-10-15 16:27:56,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851229558] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:27:56,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265844120] [2022-10-15 16:27:56,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:56,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:27:56,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:27:56,777 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:27:56,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 16:27:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:56,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 16:27:56,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:27:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:56,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:27:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:56,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265844120] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:27:56,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:27:56,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-15 16:27:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478777911] [2022-10-15 16:27:56,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:27:56,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:27:56,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:27:56,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:27:56,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:27:56,976 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 16:27:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:27:57,086 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2022-10-15 16:27:57,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:27:57,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 16:27:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:27:57,089 INFO L225 Difference]: With dead ends: 91 [2022-10-15 16:27:57,090 INFO L226 Difference]: Without dead ends: 91 [2022-10-15 16:27:57,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:27:57,092 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 82 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:27:57,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 51 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:27:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-10-15 16:27:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 37. [2022-10-15 16:27:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.375) internal successors, (44), 36 states have internal predecessors, (44), 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 16:27:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-10-15 16:27:57,100 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 10 [2022-10-15 16:27:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:27:57,101 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-10-15 16:27:57,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 16:27:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-10-15 16:27:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:27:57,102 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:57,102 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-10-15 16:27:57,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 16:27:57,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 16:27:57,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:57,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1717812574, now seen corresponding path program 1 times [2022-10-15 16:27:57,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:57,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186142754] [2022-10-15 16:27:57,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:57,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:57,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:27:57,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186142754] [2022-10-15 16:27:57,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186142754] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:27:57,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68648387] [2022-10-15 16:27:57,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:57,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:27:57,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:27:57,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:27:57,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 16:27:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:57,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 16:27:57,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:27:57,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:27:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:57,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:27:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:57,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68648387] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:27:57,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:27:57,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-10-15 16:27:57,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365991471] [2022-10-15 16:27:57,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:27:57,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:27:57,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:27:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:27:57,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:27:57,822 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 16:27:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:27:57,931 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-10-15 16:27:57,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:27:57,932 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 16:27:57,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:27:57,933 INFO L225 Difference]: With dead ends: 60 [2022-10-15 16:27:57,933 INFO L226 Difference]: Without dead ends: 60 [2022-10-15 16:27:57,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:27:57,935 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:27:57,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 60 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:27:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-15 16:27:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2022-10-15 16:27:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 45 states have internal predecessors, (55), 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 16:27:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-10-15 16:27:57,942 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 10 [2022-10-15 16:27:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:27:57,942 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-10-15 16:27:57,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 16:27:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-10-15 16:27:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:27:57,943 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:57,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:27:57,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 16:27:58,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-15 16:27:58,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:58,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1552007387, now seen corresponding path program 1 times [2022-10-15 16:27:58,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:58,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595117672] [2022-10-15 16:27:58,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:27:58,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:27:58,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595117672] [2022-10-15 16:27:58,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595117672] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:27:58,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:27:58,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:27:58,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556407064] [2022-10-15 16:27:58,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:27:58,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:27:58,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:27:58,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:27:58,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:27:58,219 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16:27:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:27:58,257 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-10-15 16:27:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:27:58,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-10-15 16:27:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:27:58,258 INFO L225 Difference]: With dead ends: 55 [2022-10-15 16:27:58,258 INFO L226 Difference]: Without dead ends: 55 [2022-10-15 16:27:58,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:27:58,260 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:27:58,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 22 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:27:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-15 16:27:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-10-15 16:27:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 states have internal predecessors, (55), 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 16:27:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-10-15 16:27:58,266 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 12 [2022-10-15 16:27:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:27:58,266 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-10-15 16:27:58,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16:27:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-10-15 16:27:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:27:58,267 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:58,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:27:58,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:27:58,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:58,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1124274294, now seen corresponding path program 1 times [2022-10-15 16:27:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:58,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502815832] [2022-10-15 16:27:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:58,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:58,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:27:58,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502815832] [2022-10-15 16:27:58,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502815832] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:27:58,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093047397] [2022-10-15 16:27:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:58,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:27:58,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:27:58,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:27:58,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 16:27:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:58,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:27:58,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:27:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:58,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:27:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:58,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093047397] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:27:58,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:27:58,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-15 16:27:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802646185] [2022-10-15 16:27:58,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:27:58,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:27:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:27:58,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:27:58,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:27:58,467 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 16:27:58,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:27:58,538 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-10-15 16:27:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:27:58,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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) Word has length 14 [2022-10-15 16:27:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:27:58,539 INFO L225 Difference]: With dead ends: 38 [2022-10-15 16:27:58,539 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 16:27:58,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:27:58,540 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:27:58,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 37 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:27:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 16:27:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 16:27:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 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 16:27:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-10-15 16:27:58,546 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2022-10-15 16:27:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:27:58,546 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-10-15 16:27:58,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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 16:27:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-10-15 16:27:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:27:58,547 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:58,547 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2022-10-15 16:27:58,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 16:27:58,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:27:58,763 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:58,765 INFO L85 PathProgramCache]: Analyzing trace with hash 377878454, now seen corresponding path program 2 times [2022-10-15 16:27:58,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:58,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369269690] [2022-10-15 16:27:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:27:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:58,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:27:58,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369269690] [2022-10-15 16:27:58,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369269690] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:27:58,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540316822] [2022-10-15 16:27:58,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:27:58,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:27:58,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:27:58,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:27:58,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 16:27:58,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:27:58,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:27:58,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 16:27:58,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:27:58,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:27:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:59,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:27:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:27:59,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540316822] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:27:59,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:27:59,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-15 16:27:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080091611] [2022-10-15 16:27:59,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:27:59,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 16:27:59,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:27:59,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 16:27:59,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:27:59,371 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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 16:27:59,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:27:59,521 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-10-15 16:27:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:27:59,521 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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) Word has length 14 [2022-10-15 16:27:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:27:59,522 INFO L225 Difference]: With dead ends: 53 [2022-10-15 16:27:59,522 INFO L226 Difference]: Without dead ends: 53 [2022-10-15 16:27:59,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:27:59,524 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 102 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:27:59,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 72 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:27:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-15 16:27:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2022-10-15 16:27:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 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 16:27:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-10-15 16:27:59,528 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2022-10-15 16:27:59,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:27:59,528 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-10-15 16:27:59,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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 16:27:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-10-15 16:27:59,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:27:59,529 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:27:59,530 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:27:59,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 16:27:59,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:27:59,743 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:27:59,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:27:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1793197410, now seen corresponding path program 2 times [2022-10-15 16:27:59,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:27:59,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161327931] [2022-10-15 16:27:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:27:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:27:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:00,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:00,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161327931] [2022-10-15 16:28:00,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161327931] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:00,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812785432] [2022-10-15 16:28:00,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:28:00,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:00,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:00,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:00,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 16:28:00,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:28:00,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:28:00,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-15 16:28:00,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:00,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-15 16:28:00,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:00,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-15 16:28:00,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-15 16:28:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:00,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:02,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int)) (or (forall ((v_ArrVal_66 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_39| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_66) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_39|)))) is different from false [2022-10-15 16:28:02,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-10-15 16:28:02,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 114 [2022-10-15 16:28:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-10-15 16:28:02,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812785432] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:02,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:02,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2022-10-15 16:28:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793733130] [2022-10-15 16:28:02,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:02,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-15 16:28:02,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:02,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-15 16:28:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2022-10-15 16:28:02,475 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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 16:28:04,506 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_39| Int)) (or (forall ((v_ArrVal_66 Int)) (= (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_39| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_66) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_39|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0))) is different from false [2022-10-15 16:28:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:04,653 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-10-15 16:28:04,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 16:28:04,654 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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 18 [2022-10-15 16:28:04,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:04,655 INFO L225 Difference]: With dead ends: 47 [2022-10-15 16:28:04,655 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 16:28:04,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=103, Invalid=283, Unknown=2, NotChecked=74, Total=462 [2022-10-15 16:28:04,657 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:04,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 45 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 114 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-10-15 16:28:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 16:28:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-10-15 16:28:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 37 states have internal predecessors, (42), 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 16:28:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-10-15 16:28:04,661 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 18 [2022-10-15 16:28:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:04,661 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-10-15 16:28:04,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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 16:28:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-10-15 16:28:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:28:04,663 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:04,663 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:04,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:04,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-15 16:28:04,873 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:04,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:04,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1825880306, now seen corresponding path program 1 times [2022-10-15 16:28:04,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:04,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349252094] [2022-10-15 16:28:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:28:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:04,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349252094] [2022-10-15 16:28:04,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349252094] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:04,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613854210] [2022-10-15 16:28:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:04,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:04,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:04,942 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:04,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 16:28:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:05,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:28:05,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:28:05,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:28:05,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613854210] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:05,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:05,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-10-15 16:28:05,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390185738] [2022-10-15 16:28:05,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:05,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:28:05,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:05,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:28:05,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:28:05,096 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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 16:28:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:05,150 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-10-15 16:28:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:28:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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) Word has length 22 [2022-10-15 16:28:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:05,151 INFO L225 Difference]: With dead ends: 48 [2022-10-15 16:28:05,151 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 16:28:05,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:28:05,152 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:05,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 30 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:28:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 16:28:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-10-15 16:28:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 40 states have internal predecessors, (45), 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 16:28:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-10-15 16:28:05,157 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 22 [2022-10-15 16:28:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:05,157 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-10-15 16:28:05,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 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 16:28:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-10-15 16:28:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:28:05,158 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:05,158 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:05,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:05,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:05,372 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1971822899, now seen corresponding path program 1 times [2022-10-15 16:28:05,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:05,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061007152] [2022-10-15 16:28:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:05,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:05,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061007152] [2022-10-15 16:28:05,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061007152] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:05,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419051857] [2022-10-15 16:28:05,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:05,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:05,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:05,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:05,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 16:28:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:05,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-15 16:28:05,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:05,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-15 16:28:05,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-10-15 16:28:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:05,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:05,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-10-15 16:28:05,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-15 16:28:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:05,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419051857] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:05,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:05,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-10-15 16:28:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073829284] [2022-10-15 16:28:05,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:05,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 16:28:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:05,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 16:28:05,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:28:05,913 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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 16:28:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:06,191 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-10-15 16:28:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-15 16:28:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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 24 [2022-10-15 16:28:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:06,192 INFO L225 Difference]: With dead ends: 84 [2022-10-15 16:28:06,193 INFO L226 Difference]: Without dead ends: 84 [2022-10-15 16:28:06,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-10-15 16:28:06,194 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 94 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:06,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 120 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-10-15 16:28:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 56. [2022-10-15 16:28:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 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 16:28:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-10-15 16:28:06,200 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 24 [2022-10-15 16:28:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:06,200 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-10-15 16:28:06,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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 16:28:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-10-15 16:28:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 16:28:06,201 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:06,202 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:06,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:06,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:06,416 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:06,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1116052259, now seen corresponding path program 2 times [2022-10-15 16:28:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:06,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228790737] [2022-10-15 16:28:06,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:06,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:28:06,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:28:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:28:06,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:28:06,494 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:28:06,496 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2022-10-15 16:28:06,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2022-10-15 16:28:06,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2022-10-15 16:28:06,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2022-10-15 16:28:06,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2022-10-15 16:28:06,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2022-10-15 16:28:06,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2022-10-15 16:28:06,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2022-10-15 16:28:06,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:28:06,505 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:06,510 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:28:06,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:28:06 BoogieIcfgContainer [2022-10-15 16:28:06,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:28:06,548 INFO L158 Benchmark]: Toolchain (without parser) took 12694.20ms. Allocated memory was 160.4MB in the beginning and 192.9MB in the end (delta: 32.5MB). Free memory was 134.5MB in the beginning and 139.5MB in the end (delta: -4.9MB). Peak memory consumption was 29.1MB. Max. memory is 8.0GB. [2022-10-15 16:28:06,548 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 160.4MB. Free memory was 130.5MB in the beginning and 130.4MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:28:06,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.44ms. Allocated memory is still 160.4MB. Free memory was 134.3MB in the beginning and 124.6MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 16:28:06,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.30ms. Allocated memory is still 160.4MB. Free memory was 124.4MB in the beginning and 123.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:28:06,549 INFO L158 Benchmark]: Boogie Preprocessor took 68.32ms. Allocated memory is still 160.4MB. Free memory was 123.0MB in the beginning and 121.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:28:06,550 INFO L158 Benchmark]: RCFGBuilder took 615.62ms. Allocated memory is still 160.4MB. Free memory was 121.7MB in the beginning and 110.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-15 16:28:06,550 INFO L158 Benchmark]: TraceAbstraction took 11473.12ms. Allocated memory was 160.4MB in the beginning and 192.9MB in the end (delta: 32.5MB). Free memory was 109.6MB in the beginning and 139.5MB in the end (delta: -29.9MB). Peak memory consumption was 4.0MB. Max. memory is 8.0GB. [2022-10-15 16:28:06,552 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.24ms. Allocated memory is still 160.4MB. Free memory was 130.5MB in the beginning and 130.4MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.44ms. Allocated memory is still 160.4MB. Free memory was 134.3MB in the beginning and 124.6MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.30ms. Allocated memory is still 160.4MB. Free memory was 124.4MB in the beginning and 123.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.32ms. Allocated memory is still 160.4MB. Free memory was 123.0MB in the beginning and 121.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 615.62ms. Allocated memory is still 160.4MB. Free memory was 121.7MB in the beginning and 110.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11473.12ms. Allocated memory was 160.4MB in the beginning and 192.9MB in the end (delta: 32.5MB). Free memory was 109.6MB in the beginning and 139.5MB in the end (delta: -29.9MB). Peak memory consumption was 4.0MB. 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: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L12] int SIZE; [L14] const int MAX = 100000; VAL [MAX=100000, SIZE=0] [L18] SIZE = __VERIFIER_nondet_int() [L19] COND TRUE SIZE > 1 && SIZE < MAX [L21] int i; [L22] int *a = malloc(sizeof(int)*SIZE); [L24] i=0 VAL [a={-1:0}, i=0, MAX=100000, SIZE=2] [L24] COND TRUE i>16 > 250) VAL [a={-1:0}, i=0, MAX=100000, SIZE=2] [L32] a[i] = 0 VAL [a={-1:0}, i=0, MAX=100000, SIZE=2] [L24] i++ VAL [a={-1:0}, i=1, MAX=100000, SIZE=2] [L24] COND TRUE i>16 > 250) VAL [a={-1:0}, i=1, MAX=100000, SIZE=2] [L32] a[i] = 0 VAL [a={-1:0}, i=1, MAX=100000, SIZE=2] [L24] i++ VAL [a={-1:0}, i=2, MAX=100000, SIZE=2] [L24] COND FALSE !(i