/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/ldv-regression/rule57_ebda_blast.c_1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:57:19,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:57:19,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:57:19,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:57:19,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:57:19,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:57:19,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:57:19,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:57:19,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:57:19,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:57:19,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:57:19,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:57:19,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:57:19,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:57:19,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:57:19,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:57:19,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:57:19,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:57:19,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:57:19,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:57:19,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:57:19,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:57:19,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:57:19,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:57:19,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:57:19,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:57:19,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:57:19,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:57:19,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:57:19,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:57:19,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:57:19,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:57:19,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:57:19,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:57:19,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:57:19,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:57:19,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:57:19,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:57:19,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:57:19,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:57:19,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:57:19,369 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:57:19,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:57:19,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:57:19,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:57:19,424 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:57:19,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:57:19,426 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:57:19,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:57:19,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:57:19,430 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:57:19,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:57:19,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:57:19,432 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:57:19,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:57:19,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:57:19,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:57:19,432 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:57:19,432 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:57:19,433 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:57:19,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:57:19,433 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:57:19,433 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:57:19,433 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:57:19,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:57:19,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:57:19,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:57:19,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:57:19,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:57:19,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:57:19,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:57:19,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:57:19,435 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:57:19,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:57:19,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:57:19,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:57:19,946 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:57:19,947 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:57:19,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule57_ebda_blast.c_1.i [2022-10-15 16:57:20,031 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab930830/7553d69541a344849e820fdcf716c413/FLAG0249aea76 [2022-10-15 16:57:20,754 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:57:20,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.c_1.i [2022-10-15 16:57:20,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab930830/7553d69541a344849e820fdcf716c413/FLAG0249aea76 [2022-10-15 16:57:21,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ab930830/7553d69541a344849e820fdcf716c413 [2022-10-15 16:57:21,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:57:21,092 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:57:21,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:57:21,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:57:21,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:57:21,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bfc0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21, skipping insertion in model container [2022-10-15 16:57:21,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:57:21,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:57:21,278 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/ldv-regression/rule57_ebda_blast.c_1.i[303,316] [2022-10-15 16:57:21,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:57:21,341 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:57:21,356 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/ldv-regression/rule57_ebda_blast.c_1.i[303,316] [2022-10-15 16:57:21,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:57:21,401 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:57:21,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21 WrapperNode [2022-10-15 16:57:21,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:57:21,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:57:21,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:57:21,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:57:21,417 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:57:21" (1/1) ... [2022-10-15 16:57:21,443 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:57:21" (1/1) ... [2022-10-15 16:57:21,494 INFO L138 Inliner]: procedures = 24, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2022-10-15 16:57:21,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:57:21,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:57:21,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:57:21,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:57:21,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:57:21,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:57:21,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:57:21,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:57:21,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:57:21,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:21,634 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:57:21,654 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:57:21,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 16:57:21,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:57:21,742 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-15 16:57:21,742 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-15 16:57:21,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:57:21,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 16:57:21,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:57:21,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:57:21,743 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-10-15 16:57:21,743 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-10-15 16:57:21,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:57:21,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:57:21,864 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:57:21,867 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:57:22,270 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:57:22,284 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:57:22,285 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 16:57:22,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:57:22 BoogieIcfgContainer [2022-10-15 16:57:22,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:57:22,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:57:22,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:57:22,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:57:22,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:57:21" (1/3) ... [2022-10-15 16:57:22,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5709ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:57:22, skipping insertion in model container [2022-10-15 16:57:22,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (2/3) ... [2022-10-15 16:57:22,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5709ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:57:22, skipping insertion in model container [2022-10-15 16:57:22,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:57:22" (3/3) ... [2022-10-15 16:57:22,332 INFO L112 eAbstractionObserver]: Analyzing ICFG rule57_ebda_blast.c_1.i [2022-10-15 16:57:22,367 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:57:22,367 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-15 16:57:22,477 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:57:22,492 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;@6cdfdbcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:57:22,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-15 16:57:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 55 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:57:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:57:22,529 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:22,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:22,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2021472907, now seen corresponding path program 1 times [2022-10-15 16:57:22,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:22,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183084039] [2022-10-15 16:57:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:23,117 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:57:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:23,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183084039] [2022-10-15 16:57:23,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183084039] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:23,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:23,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:57:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896623313] [2022-10-15 16:57:23,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:23,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:23,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:23,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:23,176 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.6153846153846154) internal successors, (63), 55 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:23,418 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-10-15 16:57:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:57:23,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-15 16:57:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:23,431 INFO L225 Difference]: With dead ends: 73 [2022-10-15 16:57:23,432 INFO L226 Difference]: Without dead ends: 69 [2022-10-15 16:57:23,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:57:23,439 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:23,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 209 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:57:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-15 16:57:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2022-10-15 16:57:23,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 52 states have internal predecessors, (60), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:57:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2022-10-15 16:57:23,492 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 10 [2022-10-15 16:57:23,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:23,494 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-10-15 16:57:23,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-10-15 16:57:23,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:57:23,497 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:23,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:23,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:57:23,499 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:23,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2021472908, now seen corresponding path program 1 times [2022-10-15 16:57:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:23,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799384273] [2022-10-15 16:57:23,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:23,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:23,904 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:57:23,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:23,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799384273] [2022-10-15 16:57:23,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799384273] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:23,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:23,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:57:23,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002438750] [2022-10-15 16:57:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:23,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:23,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:23,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:23,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:23,910 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:24,108 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-10-15 16:57:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:57:24,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-15 16:57:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:24,117 INFO L225 Difference]: With dead ends: 67 [2022-10-15 16:57:24,117 INFO L226 Difference]: Without dead ends: 67 [2022-10-15 16:57:24,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:57:24,125 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:24,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 224 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:57:24,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-15 16:57:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2022-10-15 16:57:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 51 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:57:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-10-15 16:57:24,157 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 10 [2022-10-15 16:57:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:24,158 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-10-15 16:57:24,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-10-15 16:57:24,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:57:24,162 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:24,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:24,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:57:24,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1962909774, now seen corresponding path program 1 times [2022-10-15 16:57:24,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:24,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714217463] [2022-10-15 16:57:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,409 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:57:24,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:24,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714217463] [2022-10-15 16:57:24,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714217463] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:24,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:24,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:57:24,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76239824] [2022-10-15 16:57:24,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:24,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:24,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:24,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:24,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:24,414 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:24,542 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-10-15 16:57:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:57:24,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-15 16:57:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:24,544 INFO L225 Difference]: With dead ends: 59 [2022-10-15 16:57:24,545 INFO L226 Difference]: Without dead ends: 59 [2022-10-15 16:57:24,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:57:24,547 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 52 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:24,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 218 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-15 16:57:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-10-15 16:57:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 51 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:57:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-10-15 16:57:24,557 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 13 [2022-10-15 16:57:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:24,557 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-10-15 16:57:24,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-10-15 16:57:24,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:57:24,559 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:24,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:24,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:57:24,560 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1035182616, now seen corresponding path program 1 times [2022-10-15 16:57:24,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:24,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332282517] [2022-10-15 16:57:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:24,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332282517] [2022-10-15 16:57:24,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332282517] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:24,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:24,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:57:24,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871212277] [2022-10-15 16:57:24,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:24,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:24,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:24,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:24,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:24,764 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:24,969 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-10-15 16:57:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:57:24,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-10-15 16:57:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:24,975 INFO L225 Difference]: With dead ends: 59 [2022-10-15 16:57:24,976 INFO L226 Difference]: Without dead ends: 59 [2022-10-15 16:57:24,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:57:24,983 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 53 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:24,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 158 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-15 16:57:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-10-15 16:57:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:57:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-10-15 16:57:25,001 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 18 [2022-10-15 16:57:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:25,002 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-10-15 16:57:25,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-10-15 16:57:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:57:25,003 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:25,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:25,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:57:25,004 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:25,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1035182617, now seen corresponding path program 1 times [2022-10-15 16:57:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:25,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884949024] [2022-10-15 16:57:25,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:25,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:25,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:25,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884949024] [2022-10-15 16:57:25,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884949024] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:25,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:25,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:57:25,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997635897] [2022-10-15 16:57:25,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:25,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:25,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:25,230 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:25,377 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-10-15 16:57:25,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:57:25,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-10-15 16:57:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:25,379 INFO L225 Difference]: With dead ends: 65 [2022-10-15 16:57:25,379 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 16:57:25,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:57:25,381 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 19 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:25,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 199 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 16:57:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2022-10-15 16:57:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 48 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:57:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-10-15 16:57:25,387 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 18 [2022-10-15 16:57:25,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:25,387 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-10-15 16:57:25,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-10-15 16:57:25,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 16:57:25,389 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:25,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:25,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:57:25,390 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:25,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:25,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1259824619, now seen corresponding path program 1 times [2022-10-15 16:57:25,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:25,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502240138] [2022-10-15 16:57:25,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:25,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:25,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:25,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502240138] [2022-10-15 16:57:25,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502240138] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:25,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:25,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:57:25,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938710958] [2022-10-15 16:57:25,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:25,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:25,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:25,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:25,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:25,538 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:25,673 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-10-15 16:57:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:57:25,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-10-15 16:57:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:25,675 INFO L225 Difference]: With dead ends: 57 [2022-10-15 16:57:25,692 INFO L226 Difference]: Without dead ends: 57 [2022-10-15 16:57:25,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:57:25,696 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 51 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:25,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 205 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-15 16:57:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-10-15 16:57:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 48 states have internal predecessors, (54), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:57:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-10-15 16:57:25,706 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 21 [2022-10-15 16:57:25,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:25,707 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-10-15 16:57:25,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-10-15 16:57:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 16:57:25,709 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:25,709 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:25,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:57:25,709 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:25,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2008716707, now seen corresponding path program 1 times [2022-10-15 16:57:25,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:25,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4139110] [2022-10-15 16:57:25,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:25,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:26,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:26,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:26,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:57:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:57:26,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:26,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4139110] [2022-10-15 16:57:26,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4139110] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:26,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413252192] [2022-10-15 16:57:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:26,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:26,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:26,461 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:57:26,483 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:57:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:26,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-15 16:57:26,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:26,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:26,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:26,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-15 16:57:26,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-15 16:57:27,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:57:27,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-15 16:57:27,194 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:57:27,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:57:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:27,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:27,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413252192] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:27,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:57:27,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-10-15 16:57:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385703907] [2022-10-15 16:57:27,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:27,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 16:57:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:27,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 16:57:27,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:57:27,391 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 16:57:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:27,787 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-10-15 16:57:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:57:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 29 [2022-10-15 16:57:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:27,789 INFO L225 Difference]: With dead ends: 55 [2022-10-15 16:57:27,790 INFO L226 Difference]: Without dead ends: 55 [2022-10-15 16:57:27,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:57:27,791 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 88 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:27,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 269 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 243 Invalid, 0 Unknown, 31 Unchecked, 0.2s Time] [2022-10-15 16:57:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-15 16:57:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-10-15 16:57:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 46 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:57:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-10-15 16:57:27,797 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 29 [2022-10-15 16:57:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:27,797 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-10-15 16:57:27,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 16:57:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-10-15 16:57:27,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:57:27,799 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:27,799 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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:57:27,845 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:57:28,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:28,013 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:28,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:28,015 INFO L85 PathProgramCache]: Analyzing trace with hash 99910014, now seen corresponding path program 1 times [2022-10-15 16:57:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:28,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045718447] [2022-10-15 16:57:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:28,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:28,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:28,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:57:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:57:28,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:28,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045718447] [2022-10-15 16:57:28,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045718447] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:28,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635791155] [2022-10-15 16:57:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:28,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:28,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:28,501 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:57:28,510 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:57:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:28,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-15 16:57:28,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:28,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:28,726 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 16:57:28,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 16:57:28,783 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:57:28,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-10-15 16:57:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:28,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:28,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635791155] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:28,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:57:28,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-10-15 16:57:28,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815152938] [2022-10-15 16:57:28,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:28,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 16:57:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:28,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 16:57:28,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:57:28,966 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 16:57:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:29,150 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-10-15 16:57:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:57:29,151 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-10-15 16:57:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:29,152 INFO L225 Difference]: With dead ends: 53 [2022-10-15 16:57:29,152 INFO L226 Difference]: Without dead ends: 53 [2022-10-15 16:57:29,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:57:29,153 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:29,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 196 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 60 Unchecked, 0.1s Time] [2022-10-15 16:57:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-15 16:57:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-10-15 16:57:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:57:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-10-15 16:57:29,158 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 32 [2022-10-15 16:57:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:29,159 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-10-15 16:57:29,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 16:57:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-10-15 16:57:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:57:29,161 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:29,161 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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:57:29,188 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:57:29,365 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,SelfDestructingSolverStorable7 [2022-10-15 16:57:29,366 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:29,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash 99910015, now seen corresponding path program 1 times [2022-10-15 16:57:29,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:29,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463987347] [2022-10-15 16:57:29,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:29,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:29,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:29,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:30,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:57:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:57:30,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:30,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463987347] [2022-10-15 16:57:30,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463987347] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:30,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876491701] [2022-10-15 16:57:30,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:30,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:30,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:57:30,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 16:57:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:30,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 41 conjunts are in the unsatisfiable core [2022-10-15 16:57:30,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:30,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:30,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:30,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:57:30,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-15 16:57:30,458 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 16:57:30,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 16:57:30,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:57:30,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-10-15 16:57:30,579 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:57:30,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:57:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:30,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:34,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876491701] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:34,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:57:34,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2022-10-15 16:57:34,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349099334] [2022-10-15 16:57:34,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:34,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 16:57:34,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:34,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 16:57:34,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-10-15 16:57:34,848 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:57:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:35,123 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-10-15 16:57:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:57:35,124 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 32 [2022-10-15 16:57:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:35,125 INFO L225 Difference]: With dead ends: 50 [2022-10-15 16:57:35,125 INFO L226 Difference]: Without dead ends: 50 [2022-10-15 16:57:35,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-10-15 16:57:35,126 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 96 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:35,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 197 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 175 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2022-10-15 16:57:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-15 16:57:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-15 16:57:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 16:57:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-10-15 16:57:35,131 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 32 [2022-10-15 16:57:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:35,131 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-10-15 16:57:35,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.823529411764706) internal successors, (48), 14 states have internal predecessors, (48), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 16:57:35,132 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-10-15 16:57:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 16:57:35,133 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:35,133 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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:57:35,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 16:57:35,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:35,347 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:35,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1377469741, now seen corresponding path program 1 times [2022-10-15 16:57:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:35,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441359673] [2022-10-15 16:57:35,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:35,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:57:35,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:57:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:57:35,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:57:35,439 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:57:35,440 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-10-15 16:57:35,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2022-10-15 16:57:35,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-10-15 16:57:35,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-10-15 16:57:35,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-10-15 16:57:35,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-10-15 16:57:35,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-10-15 16:57:35,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-10-15 16:57:35,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-10-15 16:57:35,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-10-15 16:57:35,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2022-10-15 16:57:35,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2022-10-15 16:57:35,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2022-10-15 16:57:35,445 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2022-10-15 16:57:35,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2022-10-15 16:57:35,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-10-15 16:57:35,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:57:35,450 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:35,455 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:57:35,465 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,467 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,468 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,469 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,469 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,469 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,470 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,470 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,470 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,471 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,472 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,473 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,473 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:35,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:57:35 BoogieIcfgContainer [2022-10-15 16:57:35,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:57:35,508 INFO L158 Benchmark]: Toolchain (without parser) took 14421.04ms. Allocated memory was 159.4MB in the beginning and 238.0MB in the end (delta: 78.6MB). Free memory was 134.2MB in the beginning and 179.8MB in the end (delta: -45.6MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-10-15 16:57:35,508 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 159.4MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:57:35,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.77ms. Allocated memory is still 159.4MB. Free memory was 134.1MB in the beginning and 123.5MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:57:35,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.42ms. Allocated memory is still 159.4MB. Free memory was 123.5MB in the beginning and 121.6MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:57:35,510 INFO L158 Benchmark]: Boogie Preprocessor took 80.16ms. Allocated memory is still 159.4MB. Free memory was 121.6MB in the beginning and 120.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:57:35,510 INFO L158 Benchmark]: RCFGBuilder took 708.30ms. Allocated memory is still 159.4MB. Free memory was 120.0MB in the beginning and 103.9MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 16:57:35,511 INFO L158 Benchmark]: TraceAbstraction took 13185.25ms. Allocated memory was 159.4MB in the beginning and 238.0MB in the end (delta: 78.6MB). Free memory was 141.4MB in the beginning and 179.8MB in the end (delta: -38.4MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. [2022-10-15 16:57:35,512 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.31ms. Allocated memory is still 159.4MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 310.77ms. Allocated memory is still 159.4MB. Free memory was 134.1MB in the beginning and 123.5MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 89.42ms. Allocated memory is still 159.4MB. Free memory was 123.5MB in the beginning and 121.6MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.16ms. Allocated memory is still 159.4MB. Free memory was 121.6MB in the beginning and 120.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 708.30ms. Allocated memory is still 159.4MB. Free memory was 120.0MB in the beginning and 103.9MB in the end (delta: 16.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13185.25ms. Allocated memory was 159.4MB in the beginning and 238.0MB in the end (delta: 78.6MB). Free memory was 141.4MB in the beginning and 179.8MB in the end (delta: -38.4MB). Peak memory consumption was 40.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * 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: 135]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 135. Possible FailurePath: [L41] struct slot *tmp_slot; [L42] int used_tmp_slot = 0; [L43] int freed_tmp_slot = 1; VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L136] CALL ebda_rsrc_controller() [L73] struct hotplug_slot *hp_slot_ptr; [L75] struct bus_info *bus_info_ptr1; [L76] int rc; VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L78] CALL, EXPR kzalloc(sizeof(*hp_slot_ptr), 1) VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L48] EXPR, FCALL calloc(1, size) [L48] return calloc(1, size); VAL [\old(flags)=1, \old(size)=8, \result={-1:0}, calloc(1, size)={-1:0}, flags=1, freed_tmp_slot=1, size=8, tmp_slot={0:0}, used_tmp_slot=0] [L78] RET, EXPR kzalloc(sizeof(*hp_slot_ptr), 1) VAL [freed_tmp_slot=1, kzalloc(sizeof(*hp_slot_ptr), 1)={-1:0}, tmp_slot={0:0}, used_tmp_slot=0] [L78] hp_slot_ptr = kzalloc(sizeof(*hp_slot_ptr), 1) [L79] COND FALSE !(!hp_slot_ptr) VAL [freed_tmp_slot=1, hp_slot_ptr={-1:0}, tmp_slot={0:0}, used_tmp_slot=0] [L83] hp_slot_ptr->b = 5 VAL [freed_tmp_slot=1, hp_slot_ptr={-1:0}, tmp_slot={0:0}, used_tmp_slot=0] [L85] CALL, EXPR kzalloc(sizeof(*tmp_slot), 1) VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L48] EXPR, FCALL calloc(1, size) [L48] return calloc(1, size); VAL [\old(flags)=1, \old(size)=16, \result={-2:0}, calloc(1, size)={-2:0}, flags=1, freed_tmp_slot=1, size=16, tmp_slot={0:0}, used_tmp_slot=0] [L85] RET, EXPR kzalloc(sizeof(*tmp_slot), 1) VAL [freed_tmp_slot=1, hp_slot_ptr={-1:0}, kzalloc(sizeof(*tmp_slot), 1)={-2:0}, tmp_slot={0:0}, used_tmp_slot=0] [L85] tmp_slot = kzalloc(sizeof(*tmp_slot), 1) [L87] COND FALSE !(!tmp_slot) [L92] used_tmp_slot = 0 [L93] freed_tmp_slot = 0 VAL [freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L95] tmp_slot->a = 2 VAL [freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L96] tmp_slot->b = 3 VAL [freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L98] CALL, EXPR ibmphp_find_same_bus_num() [L57] CALL, EXPR kzalloc(sizeof(struct bus_info), 0) VAL [freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L48] EXPR, FCALL calloc(1, size) [L48] return calloc(1, size); VAL [\old(flags)=0, \old(size)=0, \result={-3:0}, calloc(1, size)={-3:0}, flags=0, freed_tmp_slot=0, size=0, tmp_slot={-2:0}, used_tmp_slot=0] [L57] RET, EXPR kzalloc(sizeof(struct bus_info), 0) VAL [freed_tmp_slot=0, kzalloc(sizeof(struct bus_info), 0)={-3:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L57] return kzalloc(sizeof(struct bus_info), 0); [L98] RET, EXPR ibmphp_find_same_bus_num() [L98] bus_info_ptr1 = ibmphp_find_same_bus_num() [L99] COND FALSE !(!bus_info_ptr1) VAL [bus_info_ptr1={-3:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L108] tmp_slot->bus_on = bus_info_ptr1 VAL [bus_info_ptr1={-3:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L109] bus_info_ptr1 = 0 VAL [bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L111] tmp_slot->hotplug_slot = hp_slot_ptr VAL [bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L113] hp_slot_ptr->private = tmp_slot VAL [bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L114] used_tmp_slot = 1 [L116] CALL, EXPR fillslotinfo(hp_slot_ptr) [L64] return __VERIFIER_nondet_int(); [L116] RET, EXPR fillslotinfo(hp_slot_ptr) [L116] rc = fillslotinfo(hp_slot_ptr) [L117] COND FALSE !(\read(rc)) [L120] CALL, EXPR ibmphp_init_devno((struct slot **) &hp_slot_ptr->private) [L69] return __VERIFIER_nondet_int(); [L120] RET, EXPR ibmphp_init_devno((struct slot **) &hp_slot_ptr->private) [L120] rc = ibmphp_init_devno((struct slot **) &hp_slot_ptr->private) [L121] COND FALSE !(\read(rc)) [L124] return 0; VAL [\result=0, bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, rc=0, tmp_slot={-2:0}, used_tmp_slot=1] [L136] RET ebda_rsrc_controller() [L137] COND FALSE !(!used_tmp_slot) VAL [freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - 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: 8]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 63 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 453 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 1875 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 118 IncrementalHoareTripleChecker+Unchecked, 1464 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1454 IncrementalHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 411 mSDtfsCounter, 1454 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 264 ConstructedInterpolants, 15 QuantifiedInterpolants, 2118 SizeOfPredicates, 12 NumberOfNonLiveVariables, 816 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 45/84 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:57:35,533 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...