/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/heap-data/cart.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:46:59,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:46:59,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:46:59,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:46:59,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:46:59,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:46:59,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:46:59,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:46:59,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:46:59,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:46:59,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:46:59,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:46:59,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:46:59,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:46:59,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:46:59,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:46:59,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:46:59,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:46:59,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:46:59,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:46:59,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:46:59,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:46:59,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:46:59,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:46:59,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:46:59,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:46:59,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:46:59,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:46:59,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:46:59,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:46:59,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:46:59,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:46:59,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:46:59,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:46:59,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:46:59,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:46:59,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:46:59,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:46:59,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:46:59,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:46:59,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:46:59,604 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:46:59,662 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:46:59,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:46:59,664 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:46:59,664 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:46:59,665 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:46:59,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:46:59,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:46:59,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:46:59,669 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:46:59,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:46:59,670 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:46:59,671 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:46:59,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:46:59,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:46:59,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:46:59,671 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:46:59,671 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:46:59,672 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:46:59,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:46:59,672 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:46:59,672 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:46:59,672 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:46:59,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:46:59,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:46:59,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:46:59,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:46:59,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:46:59,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:46:59,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:46:59,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:46:59,675 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:47:00,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:47:00,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:47:00,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:47:00,207 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:47:00,208 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:47:00,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2022-10-15 16:47:00,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c928ee1/8f6c794932d64b58a4f0a3608eab68b9/FLAGbcf3dc37a [2022-10-15 16:47:01,140 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:47:01,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2022-10-15 16:47:01,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c928ee1/8f6c794932d64b58a4f0a3608eab68b9/FLAGbcf3dc37a [2022-10-15 16:47:01,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c928ee1/8f6c794932d64b58a4f0a3608eab68b9 [2022-10-15 16:47:01,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:47:01,438 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:47:01,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:47:01,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:47:01,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:47:01,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:47:01" (1/1) ... [2022-10-15 16:47:01,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fad6fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:01, skipping insertion in model container [2022-10-15 16:47:01,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:47:01" (1/1) ... [2022-10-15 16:47:01,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:47:01,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:47:01,910 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/heap-data/cart.i[23713,23726] [2022-10-15 16:47:01,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:47:01,930 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:47:01,989 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/heap-data/cart.i[23713,23726] [2022-10-15 16:47:01,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:47:02,033 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:47:02,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02 WrapperNode [2022-10-15 16:47:02,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:47:02,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:47:02,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:47:02,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:47:02,046 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:47:02" (1/1) ... [2022-10-15 16:47:02,069 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:47:02" (1/1) ... [2022-10-15 16:47:02,104 INFO L138 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-10-15 16:47:02,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:47:02,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:47:02,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:47:02,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:47:02,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,142 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:47:02,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:47:02,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:47:02,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:47:02,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:47:02,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:02,191 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:47:02,218 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:47:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:47:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:47:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:47:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:47:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 16:47:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 16:47:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:47:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:47:02,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:47:02,390 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:47:02,393 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:47:02,703 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:47:02,711 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:47:02,711 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-15 16:47:02,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:47:02 BoogieIcfgContainer [2022-10-15 16:47:02,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:47:02,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:47:02,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:47:02,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:47:02,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:47:01" (1/3) ... [2022-10-15 16:47:02,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119cf48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:47:02, skipping insertion in model container [2022-10-15 16:47:02,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02" (2/3) ... [2022-10-15 16:47:02,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119cf48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:47:02, skipping insertion in model container [2022-10-15 16:47:02,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:47:02" (3/3) ... [2022-10-15 16:47:02,725 INFO L112 eAbstractionObserver]: Analyzing ICFG cart.i [2022-10-15 16:47:02,748 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:47:02,749 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-10-15 16:47:02,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:47:02,819 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;@4a61234f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:47:02,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-10-15 16:47:02,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 57 states have internal predecessors, (67), 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:47:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:47:02,835 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:02,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:02,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1805830378, now seen corresponding path program 1 times [2022-10-15 16:47:02,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:02,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976036824] [2022-10-15 16:47:02,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:02,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:03,189 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:47:03,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:03,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976036824] [2022-10-15 16:47:03,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976036824] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:03,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:03,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:03,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15293431] [2022-10-15 16:47:03,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:03,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:03,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:03,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:03,257 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 57 states have internal predecessors, (67), 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 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:47:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:03,443 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-10-15 16:47:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:03,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-10-15 16:47:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:03,459 INFO L225 Difference]: With dead ends: 101 [2022-10-15 16:47:03,460 INFO L226 Difference]: Without dead ends: 97 [2022-10-15 16:47:03,463 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:47:03,468 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 57 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:03,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-10-15 16:47:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 53. [2022-10-15 16:47:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.8125) internal successors, (58), 52 states have internal predecessors, (58), 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:47:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-10-15 16:47:03,559 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 7 [2022-10-15 16:47:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:03,563 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-10-15 16:47:03,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:47:03,564 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-10-15 16:47:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:47:03,565 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:03,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:03,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:47:03,570 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:03,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:03,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1805830379, now seen corresponding path program 1 times [2022-10-15 16:47:03,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:03,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565329199] [2022-10-15 16:47:03,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:03,905 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:47:03,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:03,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565329199] [2022-10-15 16:47:03,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565329199] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:03,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:03,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:03,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829571674] [2022-10-15 16:47:03,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:03,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:03,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:03,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:03,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:03,916 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:47:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:04,055 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2022-10-15 16:47:04,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:04,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-10-15 16:47:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:04,058 INFO L225 Difference]: With dead ends: 94 [2022-10-15 16:47:04,059 INFO L226 Difference]: Without dead ends: 94 [2022-10-15 16:47:04,059 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:47:04,061 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:04,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 115 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-10-15 16:47:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 50. [2022-10-15 16:47:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.71875) internal successors, (55), 49 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:47:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-10-15 16:47:04,121 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 7 [2022-10-15 16:47:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:04,124 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-10-15 16:47:04,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:47:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-10-15 16:47:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:47:04,126 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:04,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:04,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:47:04,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:04,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:04,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1311371167, now seen corresponding path program 1 times [2022-10-15 16:47:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:04,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336151270] [2022-10-15 16:47:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:04,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:04,247 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:47:04,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:04,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336151270] [2022-10-15 16:47:04,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336151270] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:04,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:04,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:47:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030847948] [2022-10-15 16:47:04,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:04,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:04,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:04,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:04,251 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:04,421 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-10-15 16:47:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:47:04,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 16:47:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:04,431 INFO L225 Difference]: With dead ends: 65 [2022-10-15 16:47:04,431 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 16:47:04,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:04,445 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:04,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 120 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 16:47:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2022-10-15 16:47:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 58 states have internal predecessors, (66), 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:47:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-10-15 16:47:04,471 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 10 [2022-10-15 16:47:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:04,472 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-10-15 16:47:04,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-10-15 16:47:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 16:47:04,476 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:04,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:04,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:47:04,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:04,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1997832091, now seen corresponding path program 1 times [2022-10-15 16:47:04,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:04,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71773004] [2022-10-15 16:47:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:04,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:04,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:04,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71773004] [2022-10-15 16:47:04,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71773004] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:04,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:04,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:04,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458385541] [2022-10-15 16:47:04,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:04,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:04,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:04,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:04,589 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:47:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:04,645 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-10-15 16:47:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:04,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-10-15 16:47:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:04,647 INFO L225 Difference]: With dead ends: 60 [2022-10-15 16:47:04,647 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 16:47:04,647 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:47:04,661 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:04,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:47:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 16:47:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-15 16:47:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 53 states have internal predecessors, (60), 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:47:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-10-15 16:47:04,681 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 11 [2022-10-15 16:47:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:04,682 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-10-15 16:47:04,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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:47:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-10-15 16:47:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:47:04,687 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:04,688 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:04,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:47:04,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:04,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash -632998675, now seen corresponding path program 1 times [2022-10-15 16:47:04,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:04,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659605448] [2022-10-15 16:47:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:04,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:05,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659605448] [2022-10-15 16:47:05,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659605448] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:47:05,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332952451] [2022-10-15 16:47:05,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:47:05,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:47:05,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:05,099 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:47:05,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,332 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-10-15 16:47:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:47:05,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:47:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,334 INFO L225 Difference]: With dead ends: 89 [2022-10-15 16:47:05,335 INFO L226 Difference]: Without dead ends: 89 [2022-10-15 16:47:05,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:47:05,337 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 191 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 53 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:05,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-15 16:47:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2022-10-15 16:47:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 69 states have internal predecessors, (89), 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:47:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-10-15 16:47:05,366 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 18 [2022-10-15 16:47:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,366 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-10-15 16:47:05,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:47:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-10-15 16:47:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:47:05,368 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,369 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:05,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:47:05,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:05,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash -632998676, now seen corresponding path program 1 times [2022-10-15 16:47:05,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022232770] [2022-10-15 16:47:05,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:05,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022232770] [2022-10-15 16:47:05,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022232770] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:47:05,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392181649] [2022-10-15 16:47:05,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:47:05,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:47:05,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:05,532 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:47:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,662 INFO L93 Difference]: Finished difference Result 79 states and 92 transitions. [2022-10-15 16:47:05,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:47:05,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:47:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,664 INFO L225 Difference]: With dead ends: 79 [2022-10-15 16:47:05,664 INFO L226 Difference]: Without dead ends: 79 [2022-10-15 16:47:05,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:47:05,667 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 140 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 49 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-10-15 16:47:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-10-15 16:47:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 69 states have internal predecessors, (86), 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:47:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2022-10-15 16:47:05,678 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 18 [2022-10-15 16:47:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,679 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2022-10-15 16:47:05,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:47:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2022-10-15 16:47:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:47:05,681 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:05,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:47:05,682 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1851845977, now seen corresponding path program 1 times [2022-10-15 16:47:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567924871] [2022-10-15 16:47:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:05,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567924871] [2022-10-15 16:47:05,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567924871] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:47:05,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127243535] [2022-10-15 16:47:05,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:47:05,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:47:05,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:05,827 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:47:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,932 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2022-10-15 16:47:05,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:47:05,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-10-15 16:47:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,934 INFO L225 Difference]: With dead ends: 78 [2022-10-15 16:47:05,934 INFO L226 Difference]: Without dead ends: 78 [2022-10-15 16:47:05,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:47:05,936 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 151 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 73 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-15 16:47:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2022-10-15 16:47:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 69 states have internal predecessors, (84), 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:47:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-10-15 16:47:05,942 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 19 [2022-10-15 16:47:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,943 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2022-10-15 16:47:05,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:47:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2022-10-15 16:47:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 16:47:05,944 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:05,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:47:05,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2117876295, now seen corresponding path program 1 times [2022-10-15 16:47:05,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974899093] [2022-10-15 16:47:05,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:47:06,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974899093] [2022-10-15 16:47:06,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974899093] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:06,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129177881] [2022-10-15 16:47:06,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:06,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:06,014 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:47:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:06,023 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-10-15 16:47:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:06,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 28 [2022-10-15 16:47:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:06,025 INFO L225 Difference]: With dead ends: 70 [2022-10-15 16:47:06,025 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 16:47:06,026 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:47:06,027 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:06,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:47:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 16:47:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-15 16:47:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 69 states have internal predecessors, (82), 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:47:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-10-15 16:47:06,033 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 28 [2022-10-15 16:47:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:06,033 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-10-15 16:47:06,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:47:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-10-15 16:47:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:47:06,035 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:06,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:06,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:47:06,036 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:06,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1204956194, now seen corresponding path program 1 times [2022-10-15 16:47:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:06,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358170321] [2022-10-15 16:47:06,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:06,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358170321] [2022-10-15 16:47:06,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358170321] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:06,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788978222] [2022-10-15 16:47:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:06,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:06,984 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:47:06,994 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:47:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 39 conjunts are in the unsatisfiable core [2022-10-15 16:47:07,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:07,245 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 11 treesize of output 7 [2022-10-15 16:47:07,252 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 11 treesize of output 7 [2022-10-15 16:47:07,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:07,397 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 21 treesize of output 20 [2022-10-15 16:47:07,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:07,408 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 21 treesize of output 20 [2022-10-15 16:47:07,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:07,451 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 21 treesize of output 20 [2022-10-15 16:47:07,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:07,464 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 21 treesize of output 20 [2022-10-15 16:47:07,493 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:47:07,499 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:47:07,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:07,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:07,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788978222] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:07,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:07,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 12 [2022-10-15 16:47:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846655186] [2022-10-15 16:47:07,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:07,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 16:47:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:07,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 16:47:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:47:07,738 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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:47:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:08,065 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-10-15 16:47:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:47:08,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 30 [2022-10-15 16:47:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:08,067 INFO L225 Difference]: With dead ends: 118 [2022-10-15 16:47:08,067 INFO L226 Difference]: Without dead ends: 118 [2022-10-15 16:47:08,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:47:08,069 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 185 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:08,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 262 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-15 16:47:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 94. [2022-10-15 16:47:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 93 states have internal predecessors, (110), 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:47:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2022-10-15 16:47:08,075 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 30 [2022-10-15 16:47:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:08,075 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2022-10-15 16:47:08,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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:47:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2022-10-15 16:47:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 16:47:08,077 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:08,078 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:08,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 16:47:08,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:08,293 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1153216042, now seen corresponding path program 1 times [2022-10-15 16:47:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:08,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296914056] [2022-10-15 16:47:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:09,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:09,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296914056] [2022-10-15 16:47:09,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296914056] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:09,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705007095] [2022-10-15 16:47:09,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:09,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:09,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:09,561 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:47:09,582 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:47:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:09,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 28 conjunts are in the unsatisfiable core [2022-10-15 16:47:09,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:09,868 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:47:09,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:09,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2022-10-15 16:47:10,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:10,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-10-15 16:47:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:10,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:10,796 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-10-15 16:47:10,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 858 treesize of output 763 [2022-10-15 16:47:11,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:47:11,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705007095] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:11,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:11,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13] total 28 [2022-10-15 16:47:11,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528907379] [2022-10-15 16:47:11,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:11,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-15 16:47:11,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:11,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-15 16:47:11,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2022-10-15 16:47:11,846 INFO L87 Difference]: Start difference. First operand 94 states and 110 transitions. Second operand has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 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:47:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:12,575 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2022-10-15 16:47:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 16:47:12,576 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 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 34 [2022-10-15 16:47:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:12,577 INFO L225 Difference]: With dead ends: 134 [2022-10-15 16:47:12,577 INFO L226 Difference]: Without dead ends: 134 [2022-10-15 16:47:12,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=323, Invalid=1317, Unknown=0, NotChecked=0, Total=1640 [2022-10-15 16:47:12,579 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 233 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:12,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 368 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 352 Invalid, 0 Unknown, 227 Unchecked, 0.3s Time] [2022-10-15 16:47:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-10-15 16:47:12,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 111. [2022-10-15 16:47:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 110 states have internal predecessors, (135), 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:47:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2022-10-15 16:47:12,586 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 34 [2022-10-15 16:47:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:12,586 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2022-10-15 16:47:12,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 28 states have internal predecessors, (67), 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:47:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2022-10-15 16:47:12,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 16:47:12,588 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:12,589 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:12,633 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:47:12,803 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,SelfDestructingSolverStorable9 [2022-10-15 16:47:12,804 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:47:12,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:12,806 INFO L85 PathProgramCache]: Analyzing trace with hash 19648241, now seen corresponding path program 1 times [2022-10-15 16:47:12,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:12,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778242152] [2022-10-15 16:47:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:12,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:47:12,839 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:47:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:47:12,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:47:12,890 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:47:12,892 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2022-10-15 16:47:12,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2022-10-15 16:47:12,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2022-10-15 16:47:12,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2022-10-15 16:47:12,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2022-10-15 16:47:12,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2022-10-15 16:47:12,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2022-10-15 16:47:12,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2022-10-15 16:47:12,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2022-10-15 16:47:12,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2022-10-15 16:47:12,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2022-10-15 16:47:12,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2022-10-15 16:47:12,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2022-10-15 16:47:12,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2022-10-15 16:47:12,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2022-10-15 16:47:12,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2022-10-15 16:47:12,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2022-10-15 16:47:12,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2022-10-15 16:47:12,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 24 remaining) [2022-10-15 16:47:12,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2022-10-15 16:47:12,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2022-10-15 16:47:12,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (2 of 24 remaining) [2022-10-15 16:47:12,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 24 remaining) [2022-10-15 16:47:12,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 24 remaining) [2022-10-15 16:47:12,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:47:12,907 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:12,914 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:47:12,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:47:12 BoogieIcfgContainer [2022-10-15 16:47:12,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:47:12,991 INFO L158 Benchmark]: Toolchain (without parser) took 11557.65ms. Allocated memory was 162.5MB in the beginning and 261.1MB in the end (delta: 98.6MB). Free memory was 135.5MB in the beginning and 139.7MB in the end (delta: -4.1MB). Peak memory consumption was 95.2MB. Max. memory is 8.0GB. [2022-10-15 16:47:12,991 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 162.5MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:47:12,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.82ms. Allocated memory is still 162.5MB. Free memory was 135.3MB in the beginning and 119.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-15 16:47:12,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.40ms. Allocated memory is still 162.5MB. Free memory was 119.0MB in the beginning and 117.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:47:12,992 INFO L158 Benchmark]: Boogie Preprocessor took 41.83ms. Allocated memory is still 162.5MB. Free memory was 116.9MB in the beginning and 115.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:47:12,993 INFO L158 Benchmark]: RCFGBuilder took 565.76ms. Allocated memory is still 162.5MB. Free memory was 115.4MB in the beginning and 99.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-15 16:47:12,994 INFO L158 Benchmark]: TraceAbstraction took 10273.62ms. Allocated memory was 162.5MB in the beginning and 261.1MB in the end (delta: 98.6MB). Free memory was 98.8MB in the beginning and 139.7MB in the end (delta: -40.8MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. [2022-10-15 16:47:12,999 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.33ms. Allocated memory is still 162.5MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 593.82ms. Allocated memory is still 162.5MB. Free memory was 135.3MB in the beginning and 119.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.40ms. Allocated memory is still 162.5MB. Free memory was 119.0MB in the beginning and 117.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.83ms. Allocated memory is still 162.5MB. Free memory was 116.9MB in the beginning and 115.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 565.76ms. Allocated memory is still 162.5MB. Free memory was 115.4MB in the beginning and 99.3MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 10273.62ms. Allocated memory was 162.5MB in the beginning and 261.1MB in the end (delta: 98.6MB). Free memory was 98.8MB in the beginning and 139.7MB in the end (delta: -40.8MB). Peak memory consumption was 58.5MB. 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: 573]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 573. Possible FailurePath: [L574] Node *l = ((void *)0); VAL [l={0:0}] [L575] COND TRUE __VERIFIER_nondet_int() [L576] int stock = __VERIFIER_nondet_int(); [L577] COND FALSE !(stock < 0) [L579] Node *p = malloc(sizeof(*p)); [L580] p->stock = stock VAL [l={0:0}, p={-1:0}, stock=0] [L581] p->order = 0 VAL [l={0:0}, p={-1:0}, stock=0] [L582] p->next=l VAL [l={0:0}, p={-1:0}, stock=0] [L582] l=p VAL [l={-1:0}, p={-1:0}, stock=0] [L575] COND FALSE !(__VERIFIER_nondet_int()) [L584] Node *i = l; VAL [i={-1:0}, l={-1:0}, p={-1:0}, stock=0] [L585] COND TRUE i != ((void *)0) [L586] int order = __VERIFIER_nondet_int(); [L587] order < 0 || i->stock < order VAL [i={-1:0}, l={-1:0}, order=0, order < 0 || i->stock < order=0, p={-1:0}, stock=0] [L587] EXPR i->stock VAL [i={-1:0}, i->stock=0, l={-1:0}, order=0, order < 0 || i->stock < order=0, p={-1:0}, stock=0] [L587] order < 0 || i->stock < order VAL [i={-1:0}, i->stock=0, l={-1:0}, order=0, order < 0 || i->stock < order=0, p={-1:0}, stock=0] [L587] COND FALSE !(order < 0 || i->stock < order) [L589] i->order = order VAL [i={-1:0}, l={-1:0}, order=0, p={-1:0}, stock=0] [L590] EXPR i->stock VAL [i={-1:0}, i->stock=0, l={-1:0}, order=0, p={-1:0}, stock=0] [L590] i->stock = i->stock VAL [i={-1:0}, i->stock=0, l={-1:0}, order=0, p={-1:0}, stock=0] [L591] EXPR i->next VAL [i={-1:0}, i->next={0:0}, l={-1:0}, order=0, p={-1:0}, stock=0] [L591] i = i->next [L585] COND FALSE !(i != ((void *)0)) VAL [i={0:0}, l={-1:0}, order=0, p={-1:0}, stock=0] [L593] i = l VAL [i={-1:0}, l={-1:0}, order=0, p={-1:0}, stock=0] [L594] COND TRUE i != ((void *)0) VAL [i={-1:0}, l={-1:0}, order=0, p={-1:0}, stock=0] [L595] EXPR i->order VAL [i={-1:0}, i->order=0, l={-1:0}, order=0, p={-1:0}, stock=0] [L595] EXPR i->stock VAL [i={-1:0}, i->order=0, i->stock=0, l={-1:0}, order=0, p={-1:0}, stock=0] [L595] COND FALSE !(i->order > i->stock) [L597] EXPR i->next VAL [i={-1:0}, i->next={0:0}, l={-1:0}, order=0, p={-1:0}, stock=0] [L597] i = i->next [L594] COND FALSE !(i != ((void *)0)) VAL [i={0:0}, l={-1:0}, order=0, p={-1:0}, stock=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 596]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 58 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1026 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1026 mSDsluCounter, 1333 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 227 IncrementalHoareTripleChecker+Unchecked, 842 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 491 mSDtfsCounter, 885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=10, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 177 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 296 ConstructedInterpolants, 5 QuantifiedInterpolants, 2630 SizeOfPredicates, 24 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 30/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:47:13,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...