/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/float-newlib/double_req_bl_0920a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 01:18:19,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 01:18:19,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 01:18:19,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 01:18:19,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 01:18:19,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 01:18:19,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 01:18:19,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 01:18:19,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 01:18:19,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 01:18:19,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 01:18:19,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 01:18:19,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 01:18:19,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 01:18:19,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 01:18:19,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 01:18:19,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 01:18:19,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 01:18:19,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 01:18:19,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 01:18:19,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 01:18:19,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 01:18:19,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 01:18:19,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 01:18:19,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 01:18:19,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 01:18:19,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 01:18:19,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 01:18:19,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 01:18:19,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 01:18:19,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 01:18:19,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 01:18:19,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 01:18:19,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 01:18:19,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 01:18:19,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 01:18:19,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 01:18:19,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 01:18:19,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 01:18:19,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 01:18:19,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 01:18:19,762 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-16 01:18:19,809 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 01:18:19,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 01:18:19,810 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 01:18:19,810 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 01:18:19,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 01:18:19,812 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 01:18:19,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 01:18:19,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 01:18:19,815 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 01:18:19,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 01:18:19,816 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 01:18:19,816 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 01:18:19,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 01:18:19,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 01:18:19,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 01:18:19,817 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 01:18:19,817 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 01:18:19,817 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 01:18:19,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 01:18:19,818 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 01:18:19,818 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 01:18:19,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 01:18:19,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 01:18:19,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 01:18:19,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 01:18:19,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:18:19,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 01:18:19,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 01:18:19,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 01:18:19,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 01:18:19,820 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-16 01:18:20,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 01:18:20,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 01:18:20,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 01:18:20,234 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 01:18:20,235 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 01:18:20,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2022-10-16 01:18:20,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9adcb2bb8/5c74d708b662444f9c7ab8230f56a9d3/FLAGf14d3248a [2022-10-16 01:18:20,903 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 01:18:20,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0920a.c [2022-10-16 01:18:20,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9adcb2bb8/5c74d708b662444f9c7ab8230f56a9d3/FLAGf14d3248a [2022-10-16 01:18:21,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9adcb2bb8/5c74d708b662444f9c7ab8230f56a9d3 [2022-10-16 01:18:21,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 01:18:21,277 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 01:18:21,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 01:18:21,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 01:18:21,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 01:18:21,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137550cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21, skipping insertion in model container [2022-10-16 01:18:21,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 01:18:21,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 01:18:21,540 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/float-newlib/double_req_bl_0920a.c[4007,4020] [2022-10-16 01:18:21,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:18:21,554 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 01:18:21,597 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/float-newlib/double_req_bl_0920a.c[4007,4020] [2022-10-16 01:18:21,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:18:21,620 INFO L208 MainTranslator]: Completed translation [2022-10-16 01:18:21,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21 WrapperNode [2022-10-16 01:18:21,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 01:18:21,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 01:18:21,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 01:18:21,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 01:18:21,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,681 INFO L138 Inliner]: procedures = 19, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 183 [2022-10-16 01:18:21,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 01:18:21,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 01:18:21,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 01:18:21,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 01:18:21,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,720 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 01:18:21,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 01:18:21,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 01:18:21,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 01:18:21,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (1/1) ... [2022-10-16 01:18:21,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:18:21,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:18:21,778 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-16 01:18:21,802 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-16 01:18:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 01:18:21,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 01:18:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 01:18:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 01:18:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 01:18:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 01:18:21,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 01:18:21,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 01:18:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 01:18:21,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 01:18:21,953 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 01:18:21,955 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 01:18:22,483 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 01:18:22,492 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 01:18:22,492 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-10-16 01:18:22,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:18:22 BoogieIcfgContainer [2022-10-16 01:18:22,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 01:18:22,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 01:18:22,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 01:18:22,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 01:18:22,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:18:21" (1/3) ... [2022-10-16 01:18:22,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18022a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:18:22, skipping insertion in model container [2022-10-16 01:18:22,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:21" (2/3) ... [2022-10-16 01:18:22,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18022a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:18:22, skipping insertion in model container [2022-10-16 01:18:22,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:18:22" (3/3) ... [2022-10-16 01:18:22,505 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0920a.c [2022-10-16 01:18:22,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 01:18:22,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-10-16 01:18:22,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 01:18:22,593 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;@7cb4e798, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 01:18:22,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-10-16 01:18:22,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-16 01:18:22,607 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:22,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-16 01:18:22,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:22,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash 28693828, now seen corresponding path program 1 times [2022-10-16 01:18:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:22,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686449384] [2022-10-16 01:18:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:18:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:22,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686449384] [2022-10-16 01:18:22,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686449384] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:22,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:22,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070213632] [2022-10-16 01:18:22,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:22,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:22,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:22,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:23,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:23,003 INFO L87 Difference]: Start difference. First operand has 76 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:23,087 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2022-10-16 01:18:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-16 01:18:23,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:23,101 INFO L225 Difference]: With dead ends: 74 [2022-10-16 01:18:23,102 INFO L226 Difference]: Without dead ends: 72 [2022-10-16 01:18:23,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:23,108 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:23,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 138 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-16 01:18:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-10-16 01:18:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-10-16 01:18:23,154 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 5 [2022-10-16 01:18:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:23,154 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-10-16 01:18:23,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-10-16 01:18:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-16 01:18:23,155 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:23,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-16 01:18:23,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 01:18:23,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:23,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2022-10-16 01:18:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:23,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890374076] [2022-10-16 01:18:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:23,320 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-16 01:18:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:23,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890374076] [2022-10-16 01:18:23,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890374076] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:23,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:23,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:23,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507017200] [2022-10-16 01:18:23,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:23,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:23,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:23,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:23,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:23,325 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:23,378 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2022-10-16 01:18:23,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:23,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-16 01:18:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:23,380 INFO L225 Difference]: With dead ends: 70 [2022-10-16 01:18:23,380 INFO L226 Difference]: Without dead ends: 70 [2022-10-16 01:18:23,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:23,383 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:23,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 140 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:23,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-16 01:18:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-16 01:18:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 69 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-10-16 01:18:23,393 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 5 [2022-10-16 01:18:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:23,394 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2022-10-16 01:18:23,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2022-10-16 01:18:23,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 01:18:23,396 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:23,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 01:18:23,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 01:18:23,397 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:23,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:23,398 INFO L85 PathProgramCache]: Analyzing trace with hash 890247561, now seen corresponding path program 1 times [2022-10-16 01:18:23,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:23,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470795464] [2022-10-16 01:18:23,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:23,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:23,445 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-16 01:18:23,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470795464] [2022-10-16 01:18:23,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470795464] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:23,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:23,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:18:23,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129158405] [2022-10-16 01:18:23,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:23,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:23,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:23,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:23,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:23,450 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:23,464 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2022-10-16 01:18:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:23,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 01:18:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:23,466 INFO L225 Difference]: With dead ends: 71 [2022-10-16 01:18:23,466 INFO L226 Difference]: Without dead ends: 71 [2022-10-16 01:18:23,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:23,468 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:23,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-10-16 01:18:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-10-16 01:18:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.6037735849056605) internal successors, (85), 70 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2022-10-16 01:18:23,478 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 6 [2022-10-16 01:18:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:23,479 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2022-10-16 01:18:23,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2022-10-16 01:18:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 01:18:23,480 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:23,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 01:18:23,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 01:18:23,481 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash 890401412, now seen corresponding path program 1 times [2022-10-16 01:18:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:23,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304302680] [2022-10-16 01:18:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:23,508 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-16 01:18:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304302680] [2022-10-16 01:18:23,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304302680] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:23,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:23,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957190095] [2022-10-16 01:18:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:23,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:23,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:23,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:23,512 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:23,560 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-10-16 01:18:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:23,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 01:18:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:23,562 INFO L225 Difference]: With dead ends: 73 [2022-10-16 01:18:23,563 INFO L226 Difference]: Without dead ends: 70 [2022-10-16 01:18:23,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:23,565 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:23,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-16 01:18:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-16 01:18:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 69 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2022-10-16 01:18:23,574 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 6 [2022-10-16 01:18:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:23,575 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2022-10-16 01:18:23,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-10-16 01:18:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 01:18:23,576 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:23,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:23,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 01:18:23,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:23,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash -212149197, now seen corresponding path program 1 times [2022-10-16 01:18:23,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:23,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402770994] [2022-10-16 01:18:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:23,759 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-16 01:18:23,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:23,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402770994] [2022-10-16 01:18:23,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402770994] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:23,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:23,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031277616] [2022-10-16 01:18:23,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:23,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:23,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:23,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:23,766 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:23,826 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-10-16 01:18:23,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:23,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 01:18:23,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:23,828 INFO L225 Difference]: With dead ends: 67 [2022-10-16 01:18:23,829 INFO L226 Difference]: Without dead ends: 67 [2022-10-16 01:18:23,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:23,831 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:23,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 122 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-16 01:18:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-10-16 01:18:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-10-16 01:18:23,839 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 13 [2022-10-16 01:18:23,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:23,839 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-10-16 01:18:23,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-10-16 01:18:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 01:18:23,840 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:23,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:23,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 01:18:23,841 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:23,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:23,842 INFO L85 PathProgramCache]: Analyzing trace with hash -212149196, now seen corresponding path program 1 times [2022-10-16 01:18:23,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:23,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285308468] [2022-10-16 01:18:23,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:23,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:24,042 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-16 01:18:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285308468] [2022-10-16 01:18:24,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285308468] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:24,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:24,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982575153] [2022-10-16 01:18:24,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:24,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:24,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:24,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:24,046 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:24,084 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-10-16 01:18:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:24,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 01:18:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:24,086 INFO L225 Difference]: With dead ends: 64 [2022-10-16 01:18:24,086 INFO L226 Difference]: Without dead ends: 64 [2022-10-16 01:18:24,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:24,088 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:24,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 127 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-16 01:18:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-16 01:18:24,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-10-16 01:18:24,095 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 13 [2022-10-16 01:18:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:24,095 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-10-16 01:18:24,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,096 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-10-16 01:18:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 01:18:24,096 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:24,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:24,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 01:18:24,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:24,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:24,098 INFO L85 PathProgramCache]: Analyzing trace with hash -211995346, now seen corresponding path program 1 times [2022-10-16 01:18:24,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:24,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741390344] [2022-10-16 01:18:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:24,223 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-16 01:18:24,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:24,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741390344] [2022-10-16 01:18:24,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741390344] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:24,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:24,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:18:24,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761201330] [2022-10-16 01:18:24,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:24,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:18:24,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:24,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:18:24,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:18:24,226 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:24,278 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-10-16 01:18:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:18:24,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 01:18:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:24,280 INFO L225 Difference]: With dead ends: 66 [2022-10-16 01:18:24,280 INFO L226 Difference]: Without dead ends: 64 [2022-10-16 01:18:24,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:18:24,282 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:24,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 167 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-16 01:18:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-16 01:18:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 63 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-10-16 01:18:24,288 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 13 [2022-10-16 01:18:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:24,288 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-10-16 01:18:24,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-10-16 01:18:24,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 01:18:24,290 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:24,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:24,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 01:18:24,291 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:24,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1167933, now seen corresponding path program 1 times [2022-10-16 01:18:24,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:24,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148584197] [2022-10-16 01:18:24,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:24,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:24,384 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-16 01:18:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:24,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148584197] [2022-10-16 01:18:24,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148584197] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:24,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:24,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941062556] [2022-10-16 01:18:24,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:24,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:24,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:24,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:24,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:24,387 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:24,423 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-10-16 01:18:24,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:24,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 01:18:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:24,424 INFO L225 Difference]: With dead ends: 61 [2022-10-16 01:18:24,424 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 01:18:24,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:24,426 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:24,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 112 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:24,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 01:18:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-16 01:18:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 60 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-10-16 01:18:24,431 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 24 [2022-10-16 01:18:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:24,432 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-10-16 01:18:24,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-10-16 01:18:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 01:18:24,433 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:24,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:24,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 01:18:24,434 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:24,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1167932, now seen corresponding path program 1 times [2022-10-16 01:18:24,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:24,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928420864] [2022-10-16 01:18:24,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:24,563 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-16 01:18:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:24,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928420864] [2022-10-16 01:18:24,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928420864] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:24,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:24,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153355553] [2022-10-16 01:18:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:24,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:24,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:24,566 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:24,596 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-10-16 01:18:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:24,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 01:18:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:24,597 INFO L225 Difference]: With dead ends: 58 [2022-10-16 01:18:24,598 INFO L226 Difference]: Without dead ends: 58 [2022-10-16 01:18:24,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:24,599 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:24,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-16 01:18:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-10-16 01:18:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 57 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2022-10-16 01:18:24,604 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 24 [2022-10-16 01:18:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:24,604 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2022-10-16 01:18:24,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,604 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-10-16 01:18:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 01:18:24,605 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:24,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:24,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 01:18:24,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash -30780730, now seen corresponding path program 1 times [2022-10-16 01:18:24,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:24,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564045905] [2022-10-16 01:18:24,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:24,699 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-16 01:18:24,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:24,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564045905] [2022-10-16 01:18:24,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564045905] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:24,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:24,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:24,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229954377] [2022-10-16 01:18:24,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:24,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:24,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:24,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:24,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:24,702 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:24,734 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-10-16 01:18:24,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:24,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 01:18:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:24,736 INFO L225 Difference]: With dead ends: 56 [2022-10-16 01:18:24,736 INFO L226 Difference]: Without dead ends: 56 [2022-10-16 01:18:24,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:24,737 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:24,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 107 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-16 01:18:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-10-16 01:18:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-10-16 01:18:24,742 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 24 [2022-10-16 01:18:24,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:24,742 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-10-16 01:18:24,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,743 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-10-16 01:18:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 01:18:24,744 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:24,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:24,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 01:18:24,744 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash -30780729, now seen corresponding path program 1 times [2022-10-16 01:18:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:24,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822269783] [2022-10-16 01:18:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:24,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:24,919 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-16 01:18:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:24,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822269783] [2022-10-16 01:18:24,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822269783] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:24,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:24,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398134363] [2022-10-16 01:18:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:24,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:24,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:24,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:24,922 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:24,952 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-10-16 01:18:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:24,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 01:18:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:24,954 INFO L225 Difference]: With dead ends: 54 [2022-10-16 01:18:24,954 INFO L226 Difference]: Without dead ends: 54 [2022-10-16 01:18:24,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:24,955 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:24,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 112 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-16 01:18:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-16 01:18:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 53 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-10-16 01:18:24,959 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 24 [2022-10-16 01:18:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:24,959 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-10-16 01:18:24,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:18:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-10-16 01:18:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 01:18:24,961 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:24,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:24,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 01:18:24,961 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-16 01:18:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash -35701308, now seen corresponding path program 1 times [2022-10-16 01:18:24,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:24,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086978993] [2022-10-16 01:18:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:18:25,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 01:18:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:18:25,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 01:18:25,057 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 01:18:25,058 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (21 of 22 remaining) [2022-10-16 01:18:25,060 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 22 remaining) [2022-10-16 01:18:25,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 22 remaining) [2022-10-16 01:18:25,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 22 remaining) [2022-10-16 01:18:25,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 22 remaining) [2022-10-16 01:18:25,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 22 remaining) [2022-10-16 01:18:25,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 22 remaining) [2022-10-16 01:18:25,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 22 remaining) [2022-10-16 01:18:25,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 22 remaining) [2022-10-16 01:18:25,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 22 remaining) [2022-10-16 01:18:25,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 22 remaining) [2022-10-16 01:18:25,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 22 remaining) [2022-10-16 01:18:25,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 22 remaining) [2022-10-16 01:18:25,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 22 remaining) [2022-10-16 01:18:25,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 22 remaining) [2022-10-16 01:18:25,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 22 remaining) [2022-10-16 01:18:25,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 22 remaining) [2022-10-16 01:18:25,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 22 remaining) [2022-10-16 01:18:25,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 22 remaining) [2022-10-16 01:18:25,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 22 remaining) [2022-10-16 01:18:25,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 22 remaining) [2022-10-16 01:18:25,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (0 of 22 remaining) [2022-10-16 01:18:25,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 01:18:25,070 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:25,074 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 01:18:25,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:18:25 BoogieIcfgContainer [2022-10-16 01:18:25,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 01:18:25,134 INFO L158 Benchmark]: Toolchain (without parser) took 3862.44ms. Allocated memory was 151.0MB in the beginning and 191.9MB in the end (delta: 40.9MB). Free memory was 125.3MB in the beginning and 128.8MB in the end (delta: -3.5MB). Peak memory consumption was 38.4MB. Max. memory is 8.0GB. [2022-10-16 01:18:25,135 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory was 122.0MB in the beginning and 121.9MB in the end (delta: 67.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 01:18:25,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.74ms. Allocated memory is still 151.0MB. Free memory was 125.2MB in the beginning and 112.9MB in the end (delta: 12.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-16 01:18:25,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.67ms. Allocated memory is still 151.0MB. Free memory was 112.9MB in the beginning and 110.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 01:18:25,136 INFO L158 Benchmark]: Boogie Preprocessor took 43.20ms. Allocated memory is still 151.0MB. Free memory was 110.4MB in the beginning and 108.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 01:18:25,136 INFO L158 Benchmark]: RCFGBuilder took 763.77ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 122.9MB in the end (delta: -14.5MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2022-10-16 01:18:25,137 INFO L158 Benchmark]: TraceAbstraction took 2636.49ms. Allocated memory was 151.0MB in the beginning and 191.9MB in the end (delta: 40.9MB). Free memory was 121.8MB in the beginning and 128.8MB in the end (delta: -7.0MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. [2022-10-16 01:18:25,139 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.22ms. Allocated memory is still 151.0MB. Free memory was 122.0MB in the beginning and 121.9MB in the end (delta: 67.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 338.74ms. Allocated memory is still 151.0MB. Free memory was 125.2MB in the beginning and 112.9MB in the end (delta: 12.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.67ms. Allocated memory is still 151.0MB. Free memory was 112.9MB in the beginning and 110.4MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.20ms. Allocated memory is still 151.0MB. Free memory was 110.4MB in the beginning and 108.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 763.77ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 122.9MB in the end (delta: -14.5MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2636.49ms. Allocated memory was 151.0MB in the beginning and 191.9MB in the end (delta: 40.9MB). Free memory was 121.8MB in the beginning and 128.8MB in the end (delta: -7.0MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 156]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseAnd at line 135, overapproximation of someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of memtrack at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 139. Possible FailurePath: [L34-L43] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L45] static const double zero = 0.0; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L148] double x = __VERIFIER_nondet_double(); [L150] EXPR x < 0 && isfinite_double(x) [L150] CALL, EXPR isfinite_double(x) [L129] __int32_t hx; VAL [\old(x)=18014398509481998, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L131] ieee_double_shape_type gh_u; VAL [\old(x)=18014398509481998, gh_u={6:0}, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L132] gh_u.value = (x) VAL [\old(x)=18014398509481998, gh_u={6:0}, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L133] EXPR gh_u.parts.msw VAL [\old(x)=18014398509481998, gh_u={6:0}, gh_u.parts.msw=4294967295, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L133] (hx) = gh_u.parts.msw [L135] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=18014398509481998, \result=1, hx=-1, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L150] RET, EXPR isfinite_double(x) [L150] EXPR x < 0 && isfinite_double(x) VAL [isfinite_double(x)=1, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, x < 0 && isfinite_double(x)=1, zero=0] [L150] COND TRUE (x < 0 && isfinite_double(x)) [L152] CALL, EXPR __ieee754_log(x) [L48] double hfsq, f, s, z, R, w, t1, t2, dk; [L49] __int32_t k, hx, i, j; [L50] __uint32_t lx; VAL [\old(x)=18014398509481998, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L53] ieee_double_shape_type ew_u; VAL [\old(x)=18014398509481998, ew_u={5:0}, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L54] ew_u.value = (x) VAL [\old(x)=18014398509481998, ew_u={5:0}, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L55] EXPR ew_u.parts.msw VAL [\old(x)=18014398509481998, ew_u={5:0}, ew_u.parts.msw=6441402368, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L55] (hx) = ew_u.parts.msw [L56] EXPR ew_u.parts.lsw VAL [\old(x)=18014398509481998, ew_u={5:0}, ew_u.parts.lsw=18014398509481985, hx=2146435072, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L56] (lx) = ew_u.parts.lsw [L59] k = 0 VAL [\old(x)=18014398509481998, hx=2146435072, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=1, two54_log=18014398509481984, x=18014398509481998, zero=0] [L60] COND FALSE !(hx < 0x00100000) VAL [\old(x)=18014398509481998, hx=2146435072, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=1, two54_log=18014398509481984, x=18014398509481998, zero=0] [L73] COND TRUE hx >= 0x7ff00000 [L74] return x + x; VAL [\old(x)=18014398509481998, hx=2146435072, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=1, two54_log=18014398509481984, x=18014398509481998, zero=0] [L152] RET, EXPR __ieee754_log(x) [L152] double res = __ieee754_log(x); [L155] CALL, EXPR isnan_double(res) [L139] return x != x; VAL [\old(x)=18014398509481997, \result=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481997, zero=0] [L155] RET, EXPR isnan_double(res) [L155] COND TRUE !isnan_double(res) [L156] reach_error() VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, res=18014398509481997, two54_log=18014398509481984, x=18014398509481998, zero=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 141]: 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 1 procedures, 76 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 1439 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 633 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 806 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 34, 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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-16 01:18:25,192 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...