/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_0530b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:43:22,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:43:22,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:43:22,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:43:22,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:43:22,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:43:22,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:43:22,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:43:22,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:43:22,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:43:22,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:43:22,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:43:22,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:43:22,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:43:22,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:43:22,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:43:22,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:43:22,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:43:22,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:43:22,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:43:22,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:43:22,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:43:22,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:43:22,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:43:22,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:43:22,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:43:22,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:43:22,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:43:22,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:43:22,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:43:22,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:43:22,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:43:22,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:43:22,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:43:22,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:43:22,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:43:22,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:43:22,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:43:22,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:43:22,345 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:43:22,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:43:22,348 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:43:22,404 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:43:22,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:43:22,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:43:22,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:43:22,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:43:22,407 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:43:22,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:43:22,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:43:22,409 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:43:22,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:43:22,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:43:22,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:43:22,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:43:22,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:43:22,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:43:22,412 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:43:22,413 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:43:22,413 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:43:22,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:43:22,413 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:43:22,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:43:22,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:43:22,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:43:22,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:43:22,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:43:22,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:43:22,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:43:22,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:43:22,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:43:22,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:43:22,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:43:22,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:43:22,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:43:22,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:43:22,893 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:43:22,894 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:43:22,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0530b.c [2022-10-15 16:43:23,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf2daace/e01e287ee3794c6d9949e4e0c9c5bb70/FLAG166a5d5f9 [2022-10-15 16:43:23,784 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:43:23,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0530b.c [2022-10-15 16:43:23,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf2daace/e01e287ee3794c6d9949e4e0c9c5bb70/FLAG166a5d5f9 [2022-10-15 16:43:24,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf2daace/e01e287ee3794c6d9949e4e0c9c5bb70 [2022-10-15 16:43:24,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:43:24,099 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:43:24,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:43:24,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:43:24,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:43:24,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:24,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef24ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24, skipping insertion in model container [2022-10-15 16:43:24,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:24,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:43:24,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:43:24,588 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_0530b.c[16384,16397] [2022-10-15 16:43:24,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:43:24,614 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:43:24,793 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_0530b.c[16384,16397] [2022-10-15 16:43:24,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:43:24,838 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:43:24,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24 WrapperNode [2022-10-15 16:43:24,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:43:24,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:43:24,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:43:24,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:43:24,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:24,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:24,970 INFO L138 Inliner]: procedures = 26, calls = 400, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 990 [2022-10-15 16:43:24,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:43:24,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:43:24,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:43:24,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:43:24,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:24,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:24,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:24,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:25,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:25,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:25,138 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:25,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:25,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:43:25,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:43:25,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:43:25,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:43:25,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (1/1) ... [2022-10-15 16:43:25,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:43:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:43:25,225 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:43:25,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:43:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:43:25,293 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_double [2022-10-15 16:43:25,294 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_double [2022-10-15 16:43:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:43:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-10-15 16:43:25,294 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-10-15 16:43:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:43:25,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:43:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:43:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure __kernel_tan [2022-10-15 16:43:25,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __kernel_tan [2022-10-15 16:43:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:43:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:43:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_double [2022-10-15 16:43:25,295 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_double [2022-10-15 16:43:25,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:43:25,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:43:25,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:43:25,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:43:25,533 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:43:25,536 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:43:27,508 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:43:27,522 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:43:27,522 INFO L300 CfgBuilder]: Removed 67 assume(true) statements. [2022-10-15 16:43:27,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:43:27 BoogieIcfgContainer [2022-10-15 16:43:27,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:43:27,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:43:27,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:43:27,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:43:27,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:43:24" (1/3) ... [2022-10-15 16:43:27,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7757b2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:43:27, skipping insertion in model container [2022-10-15 16:43:27,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:24" (2/3) ... [2022-10-15 16:43:27,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7757b2a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:43:27, skipping insertion in model container [2022-10-15 16:43:27,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:43:27" (3/3) ... [2022-10-15 16:43:27,537 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0530b.c [2022-10-15 16:43:27,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:43:27,560 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 354 error locations. [2022-10-15 16:43:27,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:43:27,641 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;@5b495ce3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:43:27,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 354 error locations. [2022-10-15 16:43:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 859 states, 489 states have (on average 2.069529652351738) internal successors, (1012), 843 states have internal predecessors, (1012), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:43:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:43:27,658 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:27,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:43:27,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 351 more)] === [2022-10-15 16:43:27,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash 14162757, now seen corresponding path program 1 times [2022-10-15 16:43:27,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:27,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490311411] [2022-10-15 16:43:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:28,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:28,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490311411] [2022-10-15 16:43:28,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490311411] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:28,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:28,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230328174] [2022-10-15 16:43:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:28,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:28,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:28,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:28,214 INFO L87 Difference]: Start difference. First operand has 859 states, 489 states have (on average 2.069529652351738) internal successors, (1012), 843 states have internal predecessors, (1012), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:28,978 INFO L93 Difference]: Finished difference Result 857 states and 960 transitions. [2022-10-15 16:43:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:28,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:43:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:29,001 INFO L225 Difference]: With dead ends: 857 [2022-10-15 16:43:29,001 INFO L226 Difference]: Without dead ends: 855 [2022-10-15 16:43:29,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:29,009 INFO L413 NwaCegarLoop]: 955 mSDtfsCounter, 4 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:29,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1499 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 16:43:29,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-10-15 16:43:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-10-15 16:43:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 488 states have (on average 1.9180327868852458) internal successors, (936), 839 states have internal predecessors, (936), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:43:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 958 transitions. [2022-10-15 16:43:29,125 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 958 transitions. Word has length 4 [2022-10-15 16:43:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:29,126 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 958 transitions. [2022-10-15 16:43:29,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:29,126 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 958 transitions. [2022-10-15 16:43:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:43:29,127 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:29,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:43:29,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:43:29,128 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 351 more)] === [2022-10-15 16:43:29,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash 14162758, now seen corresponding path program 1 times [2022-10-15 16:43:29,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:29,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031824340] [2022-10-15 16:43:29,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:29,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:29,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:29,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031824340] [2022-10-15 16:43:29,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031824340] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:29,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:29,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566079761] [2022-10-15 16:43:29,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:29,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:29,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:29,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:29,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:29,449 INFO L87 Difference]: Start difference. First operand 855 states and 958 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:30,028 INFO L93 Difference]: Finished difference Result 853 states and 956 transitions. [2022-10-15 16:43:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:30,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:43:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:30,036 INFO L225 Difference]: With dead ends: 853 [2022-10-15 16:43:30,036 INFO L226 Difference]: Without dead ends: 853 [2022-10-15 16:43:30,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:30,038 INFO L413 NwaCegarLoop]: 953 mSDtfsCounter, 2 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:30,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1531 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:43:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2022-10-15 16:43:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 853. [2022-10-15 16:43:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 488 states have (on average 1.9139344262295082) internal successors, (934), 837 states have internal predecessors, (934), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:43:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 956 transitions. [2022-10-15 16:43:30,065 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 956 transitions. Word has length 4 [2022-10-15 16:43:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:30,065 INFO L495 AbstractCegarLoop]: Abstraction has 853 states and 956 transitions. [2022-10-15 16:43:30,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 956 transitions. [2022-10-15 16:43:30,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:43:30,067 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:30,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:30,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:43:30,067 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __kernel_tanErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 351 more)] === [2022-10-15 16:43:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 708402332, now seen corresponding path program 1 times [2022-10-15 16:43:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:30,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435845973] [2022-10-15 16:43:30,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:30,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435845973] [2022-10-15 16:43:30,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435845973] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:30,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:30,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:30,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774714858] [2022-10-15 16:43:30,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:30,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:30,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:30,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:30,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:30,234 INFO L87 Difference]: Start difference. First operand 853 states and 956 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:30,779 INFO L93 Difference]: Finished difference Result 851 states and 954 transitions. [2022-10-15 16:43:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:30,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 16:43:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:30,789 INFO L225 Difference]: With dead ends: 851 [2022-10-15 16:43:30,789 INFO L226 Difference]: Without dead ends: 851 [2022-10-15 16:43:30,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:30,791 INFO L413 NwaCegarLoop]: 949 mSDtfsCounter, 4 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:30,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1490 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:43:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-10-15 16:43:30,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2022-10-15 16:43:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 488 states have (on average 1.9098360655737705) internal successors, (932), 835 states have internal predecessors, (932), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:43:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 954 transitions. [2022-10-15 16:43:30,839 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 954 transitions. Word has length 13 [2022-10-15 16:43:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:30,840 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 954 transitions. [2022-10-15 16:43:30,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 954 transitions. [2022-10-15 16:43:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:43:30,841 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:30,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:30,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:43:30,842 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __kernel_tanErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 351 more)] === [2022-10-15 16:43:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash 708402333, now seen corresponding path program 1 times [2022-10-15 16:43:30,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:30,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115514910] [2022-10-15 16:43:30,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:31,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:31,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115514910] [2022-10-15 16:43:31,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115514910] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:31,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:31,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:31,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660824] [2022-10-15 16:43:31,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:31,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:31,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:31,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:31,131 INFO L87 Difference]: Start difference. First operand 851 states and 954 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:31,697 INFO L93 Difference]: Finished difference Result 849 states and 952 transitions. [2022-10-15 16:43:31,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:31,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 16:43:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:31,706 INFO L225 Difference]: With dead ends: 849 [2022-10-15 16:43:31,706 INFO L226 Difference]: Without dead ends: 849 [2022-10-15 16:43:31,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:31,708 INFO L413 NwaCegarLoop]: 949 mSDtfsCounter, 2 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:31,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1525 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:43:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-10-15 16:43:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2022-10-15 16:43:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 488 states have (on average 1.9057377049180328) internal successors, (930), 833 states have internal predecessors, (930), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:43:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 952 transitions. [2022-10-15 16:43:31,734 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 952 transitions. Word has length 13 [2022-10-15 16:43:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:31,734 INFO L495 AbstractCegarLoop]: Abstraction has 849 states and 952 transitions. [2022-10-15 16:43:31,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 952 transitions. [2022-10-15 16:43:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:43:31,736 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:31,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:31,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:43:31,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 351 more)] === [2022-10-15 16:43:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1822927891, now seen corresponding path program 1 times [2022-10-15 16:43:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:31,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350299605] [2022-10-15 16:43:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:31,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:31,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350299605] [2022-10-15 16:43:31,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350299605] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:31,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:31,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:31,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946883701] [2022-10-15 16:43:31,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:31,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:31,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:31,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:31,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:31,847 INFO L87 Difference]: Start difference. First operand 849 states and 952 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:32,368 INFO L93 Difference]: Finished difference Result 847 states and 950 transitions. [2022-10-15 16:43:32,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:32,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:43:32,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:32,375 INFO L225 Difference]: With dead ends: 847 [2022-10-15 16:43:32,375 INFO L226 Difference]: Without dead ends: 847 [2022-10-15 16:43:32,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:32,378 INFO L413 NwaCegarLoop]: 945 mSDtfsCounter, 4 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:32,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1484 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:43:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-10-15 16:43:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2022-10-15 16:43:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 488 states have (on average 1.901639344262295) internal successors, (928), 831 states have internal predecessors, (928), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:43:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 950 transitions. [2022-10-15 16:43:32,421 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 950 transitions. Word has length 12 [2022-10-15 16:43:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:32,422 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 950 transitions. [2022-10-15 16:43:32,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 950 transitions. [2022-10-15 16:43:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:43:32,423 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:32,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:32,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:43:32,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 351 more)] === [2022-10-15 16:43:32,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1822927892, now seen corresponding path program 1 times [2022-10-15 16:43:32,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:32,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590416394] [2022-10-15 16:43:32,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:32,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:32,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:32,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590416394] [2022-10-15 16:43:32,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590416394] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:32,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:32,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934350528] [2022-10-15 16:43:32,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:32,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:32,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:32,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:32,600 INFO L87 Difference]: Start difference. First operand 847 states and 950 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:33,114 INFO L93 Difference]: Finished difference Result 845 states and 948 transitions. [2022-10-15 16:43:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:43:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:33,121 INFO L225 Difference]: With dead ends: 845 [2022-10-15 16:43:33,121 INFO L226 Difference]: Without dead ends: 845 [2022-10-15 16:43:33,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:33,123 INFO L413 NwaCegarLoop]: 945 mSDtfsCounter, 2 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:33,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1519 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:43:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-10-15 16:43:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2022-10-15 16:43:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 488 states have (on average 1.8975409836065573) internal successors, (926), 829 states have internal predecessors, (926), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:43:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 948 transitions. [2022-10-15 16:43:33,147 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 948 transitions. Word has length 12 [2022-10-15 16:43:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:33,147 INFO L495 AbstractCegarLoop]: Abstraction has 845 states and 948 transitions. [2022-10-15 16:43:33,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:33,148 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 948 transitions. [2022-10-15 16:43:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:43:33,148 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:33,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:33,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:43:33,149 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr256REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 351 more)] === [2022-10-15 16:43:33,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:33,150 INFO L85 PathProgramCache]: Analyzing trace with hash -479044172, now seen corresponding path program 1 times [2022-10-15 16:43:33,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:33,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665585285] [2022-10-15 16:43:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:33,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:33,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:33,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665585285] [2022-10-15 16:43:33,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665585285] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:33,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:33,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:33,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800657408] [2022-10-15 16:43:33,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:33,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:33,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:33,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:33,285 INFO L87 Difference]: Start difference. First operand 845 states and 948 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:33,797 INFO L93 Difference]: Finished difference Result 843 states and 946 transitions. [2022-10-15 16:43:33,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:33,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:43:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:33,802 INFO L225 Difference]: With dead ends: 843 [2022-10-15 16:43:33,802 INFO L226 Difference]: Without dead ends: 843 [2022-10-15 16:43:33,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:33,804 INFO L413 NwaCegarLoop]: 941 mSDtfsCounter, 4 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:33,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1477 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:43:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-10-15 16:43:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2022-10-15 16:43:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 488 states have (on average 1.8934426229508197) internal successors, (924), 827 states have internal predecessors, (924), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:43:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 946 transitions. [2022-10-15 16:43:33,826 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 946 transitions. Word has length 14 [2022-10-15 16:43:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:33,827 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 946 transitions. [2022-10-15 16:43:33,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 946 transitions. [2022-10-15 16:43:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:43:33,828 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:33,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:33,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:43:33,829 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr257REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 351 more)] === [2022-10-15 16:43:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:33,829 INFO L85 PathProgramCache]: Analyzing trace with hash -479044171, now seen corresponding path program 1 times [2022-10-15 16:43:33,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:33,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054478794] [2022-10-15 16:43:33,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:33,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:33,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:33,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:33,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054478794] [2022-10-15 16:43:33,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054478794] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:33,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:33,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:33,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146847037] [2022-10-15 16:43:33,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:33,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:33,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:33,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:34,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:34,000 INFO L87 Difference]: Start difference. First operand 843 states and 946 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:34,470 INFO L93 Difference]: Finished difference Result 841 states and 944 transitions. [2022-10-15 16:43:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:34,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:43:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:34,476 INFO L225 Difference]: With dead ends: 841 [2022-10-15 16:43:34,476 INFO L226 Difference]: Without dead ends: 841 [2022-10-15 16:43:34,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:34,477 INFO L413 NwaCegarLoop]: 941 mSDtfsCounter, 2 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:34,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1512 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 16:43:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-10-15 16:43:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2022-10-15 16:43:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 488 states have (on average 1.889344262295082) internal successors, (922), 825 states have internal predecessors, (922), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:43:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 944 transitions. [2022-10-15 16:43:34,499 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 944 transitions. Word has length 14 [2022-10-15 16:43:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:34,500 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 944 transitions. [2022-10-15 16:43:34,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 944 transitions. [2022-10-15 16:43:34,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:43:34,501 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:34,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:34,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:43:34,502 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr261ASSERT_VIOLATIONMEMORY_LEAK === [scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 351 more)] === [2022-10-15 16:43:34,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:34,502 INFO L85 PathProgramCache]: Analyzing trace with hash -479020212, now seen corresponding path program 1 times [2022-10-15 16:43:34,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:34,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709077228] [2022-10-15 16:43:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:34,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:34,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:34,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709077228] [2022-10-15 16:43:34,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709077228] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:34,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:34,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:43:34,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242833608] [2022-10-15 16:43:34,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:34,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:34,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:34,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:34,560 INFO L87 Difference]: Start difference. First operand 841 states and 944 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:34,585 INFO L93 Difference]: Finished difference Result 842 states and 945 transitions. [2022-10-15 16:43:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:34,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:43:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:34,591 INFO L225 Difference]: With dead ends: 842 [2022-10-15 16:43:34,591 INFO L226 Difference]: Without dead ends: 842 [2022-10-15 16:43:34,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:34,595 INFO L413 NwaCegarLoop]: 943 mSDtfsCounter, 0 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:34,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1880 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:43:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-10-15 16:43:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2022-10-15 16:43:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 489 states have (on average 1.887525562372188) internal successors, (923), 826 states have internal predecessors, (923), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-10-15 16:43:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 945 transitions. [2022-10-15 16:43:34,618 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 945 transitions. Word has length 14 [2022-10-15 16:43:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:34,619 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 945 transitions. [2022-10-15 16:43:34,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 945 transitions. [2022-10-15 16:43:34,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:43:34,623 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:34,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:34,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:43:34,624 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr260ASSERT_VIOLATIONMEMORY_LEAK === [scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 351 more)] === [2022-10-15 16:43:34,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:34,625 INFO L85 PathProgramCache]: Analyzing trace with hash -479020341, now seen corresponding path program 1 times [2022-10-15 16:43:34,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:34,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47438320] [2022-10-15 16:43:34,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:34,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:43:34,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:43:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:43:34,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:43:34,819 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:43:34,821 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr260ASSERT_VIOLATIONMEMORY_LEAK (353 of 354 remaining) [2022-10-15 16:43:34,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (352 of 354 remaining) [2022-10-15 16:43:34,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (351 of 354 remaining) [2022-10-15 16:43:34,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (350 of 354 remaining) [2022-10-15 16:43:34,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (349 of 354 remaining) [2022-10-15 16:43:34,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (348 of 354 remaining) [2022-10-15 16:43:34,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (347 of 354 remaining) [2022-10-15 16:43:34,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (346 of 354 remaining) [2022-10-15 16:43:34,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (345 of 354 remaining) [2022-10-15 16:43:34,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (344 of 354 remaining) [2022-10-15 16:43:34,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (343 of 354 remaining) [2022-10-15 16:43:34,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (342 of 354 remaining) [2022-10-15 16:43:34,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (341 of 354 remaining) [2022-10-15 16:43:34,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (340 of 354 remaining) [2022-10-15 16:43:34,826 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (339 of 354 remaining) [2022-10-15 16:43:34,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (338 of 354 remaining) [2022-10-15 16:43:34,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (337 of 354 remaining) [2022-10-15 16:43:34,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (336 of 354 remaining) [2022-10-15 16:43:34,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (335 of 354 remaining) [2022-10-15 16:43:34,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (334 of 354 remaining) [2022-10-15 16:43:34,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (333 of 354 remaining) [2022-10-15 16:43:34,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (332 of 354 remaining) [2022-10-15 16:43:34,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location scalbn_doubleErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (331 of 354 remaining) [2022-10-15 16:43:34,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (330 of 354 remaining) [2022-10-15 16:43:34,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (329 of 354 remaining) [2022-10-15 16:43:34,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (328 of 354 remaining) [2022-10-15 16:43:34,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (327 of 354 remaining) [2022-10-15 16:43:34,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (326 of 354 remaining) [2022-10-15 16:43:34,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (325 of 354 remaining) [2022-10-15 16:43:34,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (324 of 354 remaining) [2022-10-15 16:43:34,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (323 of 354 remaining) [2022-10-15 16:43:34,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (322 of 354 remaining) [2022-10-15 16:43:34,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (321 of 354 remaining) [2022-10-15 16:43:34,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (320 of 354 remaining) [2022-10-15 16:43:34,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (319 of 354 remaining) [2022-10-15 16:43:34,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (318 of 354 remaining) [2022-10-15 16:43:34,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location copysign_doubleErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (317 of 354 remaining) [2022-10-15 16:43:34,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (316 of 354 remaining) [2022-10-15 16:43:34,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (315 of 354 remaining) [2022-10-15 16:43:34,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (314 of 354 remaining) [2022-10-15 16:43:34,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (313 of 354 remaining) [2022-10-15 16:43:34,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (312 of 354 remaining) [2022-10-15 16:43:34,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (311 of 354 remaining) [2022-10-15 16:43:34,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (310 of 354 remaining) [2022-10-15 16:43:34,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (309 of 354 remaining) [2022-10-15 16:43:34,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (308 of 354 remaining) [2022-10-15 16:43:34,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (307 of 354 remaining) [2022-10-15 16:43:34,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (306 of 354 remaining) [2022-10-15 16:43:34,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (305 of 354 remaining) [2022-10-15 16:43:34,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (304 of 354 remaining) [2022-10-15 16:43:34,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (303 of 354 remaining) [2022-10-15 16:43:34,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (302 of 354 remaining) [2022-10-15 16:43:34,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (301 of 354 remaining) [2022-10-15 16:43:34,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (300 of 354 remaining) [2022-10-15 16:43:34,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (299 of 354 remaining) [2022-10-15 16:43:34,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (298 of 354 remaining) [2022-10-15 16:43:34,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (297 of 354 remaining) [2022-10-15 16:43:34,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (296 of 354 remaining) [2022-10-15 16:43:34,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (295 of 354 remaining) [2022-10-15 16:43:34,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (294 of 354 remaining) [2022-10-15 16:43:34,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (293 of 354 remaining) [2022-10-15 16:43:34,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (292 of 354 remaining) [2022-10-15 16:43:34,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (291 of 354 remaining) [2022-10-15 16:43:34,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (290 of 354 remaining) [2022-10-15 16:43:34,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (289 of 354 remaining) [2022-10-15 16:43:34,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (288 of 354 remaining) [2022-10-15 16:43:34,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (287 of 354 remaining) [2022-10-15 16:43:34,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (286 of 354 remaining) [2022-10-15 16:43:34,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (285 of 354 remaining) [2022-10-15 16:43:34,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (284 of 354 remaining) [2022-10-15 16:43:34,847 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (283 of 354 remaining) [2022-10-15 16:43:34,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (282 of 354 remaining) [2022-10-15 16:43:34,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (281 of 354 remaining) [2022-10-15 16:43:34,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (280 of 354 remaining) [2022-10-15 16:43:34,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (279 of 354 remaining) [2022-10-15 16:43:34,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (278 of 354 remaining) [2022-10-15 16:43:34,848 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (277 of 354 remaining) [2022-10-15 16:43:34,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (276 of 354 remaining) [2022-10-15 16:43:34,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (275 of 354 remaining) [2022-10-15 16:43:34,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (274 of 354 remaining) [2022-10-15 16:43:34,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (273 of 354 remaining) [2022-10-15 16:43:34,849 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (272 of 354 remaining) [2022-10-15 16:43:34,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (271 of 354 remaining) [2022-10-15 16:43:34,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (270 of 354 remaining) [2022-10-15 16:43:34,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (269 of 354 remaining) [2022-10-15 16:43:34,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (268 of 354 remaining) [2022-10-15 16:43:34,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (267 of 354 remaining) [2022-10-15 16:43:34,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (266 of 354 remaining) [2022-10-15 16:43:34,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (265 of 354 remaining) [2022-10-15 16:43:34,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (264 of 354 remaining) [2022-10-15 16:43:34,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (263 of 354 remaining) [2022-10-15 16:43:34,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (262 of 354 remaining) [2022-10-15 16:43:34,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kernel_tanErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (261 of 354 remaining) [2022-10-15 16:43:34,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (260 of 354 remaining) [2022-10-15 16:43:34,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (259 of 354 remaining) [2022-10-15 16:43:34,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (258 of 354 remaining) [2022-10-15 16:43:34,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (257 of 354 remaining) [2022-10-15 16:43:34,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (256 of 354 remaining) [2022-10-15 16:43:34,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (255 of 354 remaining) [2022-10-15 16:43:34,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (254 of 354 remaining) [2022-10-15 16:43:34,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (253 of 354 remaining) [2022-10-15 16:43:34,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (252 of 354 remaining) [2022-10-15 16:43:34,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (251 of 354 remaining) [2022-10-15 16:43:34,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (250 of 354 remaining) [2022-10-15 16:43:34,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (249 of 354 remaining) [2022-10-15 16:43:34,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (248 of 354 remaining) [2022-10-15 16:43:34,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (247 of 354 remaining) [2022-10-15 16:43:34,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (246 of 354 remaining) [2022-10-15 16:43:34,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (245 of 354 remaining) [2022-10-15 16:43:34,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (244 of 354 remaining) [2022-10-15 16:43:34,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (243 of 354 remaining) [2022-10-15 16:43:34,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (242 of 354 remaining) [2022-10-15 16:43:34,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (241 of 354 remaining) [2022-10-15 16:43:34,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (240 of 354 remaining) [2022-10-15 16:43:34,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (239 of 354 remaining) [2022-10-15 16:43:34,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (238 of 354 remaining) [2022-10-15 16:43:34,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (237 of 354 remaining) [2022-10-15 16:43:34,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (236 of 354 remaining) [2022-10-15 16:43:34,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (235 of 354 remaining) [2022-10-15 16:43:34,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (234 of 354 remaining) [2022-10-15 16:43:34,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (233 of 354 remaining) [2022-10-15 16:43:34,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (232 of 354 remaining) [2022-10-15 16:43:34,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (231 of 354 remaining) [2022-10-15 16:43:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (230 of 354 remaining) [2022-10-15 16:43:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (229 of 354 remaining) [2022-10-15 16:43:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (228 of 354 remaining) [2022-10-15 16:43:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (227 of 354 remaining) [2022-10-15 16:43:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (226 of 354 remaining) [2022-10-15 16:43:34,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (225 of 354 remaining) [2022-10-15 16:43:34,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (224 of 354 remaining) [2022-10-15 16:43:34,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (223 of 354 remaining) [2022-10-15 16:43:34,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (222 of 354 remaining) [2022-10-15 16:43:34,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (221 of 354 remaining) [2022-10-15 16:43:34,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (220 of 354 remaining) [2022-10-15 16:43:34,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (219 of 354 remaining) [2022-10-15 16:43:34,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (218 of 354 remaining) [2022-10-15 16:43:34,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (217 of 354 remaining) [2022-10-15 16:43:34,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (216 of 354 remaining) [2022-10-15 16:43:34,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (215 of 354 remaining) [2022-10-15 16:43:34,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (214 of 354 remaining) [2022-10-15 16:43:34,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (213 of 354 remaining) [2022-10-15 16:43:34,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (212 of 354 remaining) [2022-10-15 16:43:34,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (211 of 354 remaining) [2022-10-15 16:43:34,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (210 of 354 remaining) [2022-10-15 16:43:34,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (209 of 354 remaining) [2022-10-15 16:43:34,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (208 of 354 remaining) [2022-10-15 16:43:34,863 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (207 of 354 remaining) [2022-10-15 16:43:34,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (206 of 354 remaining) [2022-10-15 16:43:34,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (205 of 354 remaining) [2022-10-15 16:43:34,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (204 of 354 remaining) [2022-10-15 16:43:34,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (203 of 354 remaining) [2022-10-15 16:43:34,864 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (202 of 354 remaining) [2022-10-15 16:43:34,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (201 of 354 remaining) [2022-10-15 16:43:34,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (200 of 354 remaining) [2022-10-15 16:43:34,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (199 of 354 remaining) [2022-10-15 16:43:34,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (198 of 354 remaining) [2022-10-15 16:43:34,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (197 of 354 remaining) [2022-10-15 16:43:34,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (196 of 354 remaining) [2022-10-15 16:43:34,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (195 of 354 remaining) [2022-10-15 16:43:34,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (194 of 354 remaining) [2022-10-15 16:43:34,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (193 of 354 remaining) [2022-10-15 16:43:34,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (192 of 354 remaining) [2022-10-15 16:43:34,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (191 of 354 remaining) [2022-10-15 16:43:34,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (190 of 354 remaining) [2022-10-15 16:43:34,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (189 of 354 remaining) [2022-10-15 16:43:34,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (188 of 354 remaining) [2022-10-15 16:43:34,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (187 of 354 remaining) [2022-10-15 16:43:34,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (186 of 354 remaining) [2022-10-15 16:43:34,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (185 of 354 remaining) [2022-10-15 16:43:34,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (184 of 354 remaining) [2022-10-15 16:43:34,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (183 of 354 remaining) [2022-10-15 16:43:34,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (182 of 354 remaining) [2022-10-15 16:43:34,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (181 of 354 remaining) [2022-10-15 16:43:34,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (180 of 354 remaining) [2022-10-15 16:43:34,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (179 of 354 remaining) [2022-10-15 16:43:34,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (178 of 354 remaining) [2022-10-15 16:43:34,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (177 of 354 remaining) [2022-10-15 16:43:34,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (176 of 354 remaining) [2022-10-15 16:43:34,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (175 of 354 remaining) [2022-10-15 16:43:34,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (174 of 354 remaining) [2022-10-15 16:43:34,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (173 of 354 remaining) [2022-10-15 16:43:34,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (172 of 354 remaining) [2022-10-15 16:43:34,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (171 of 354 remaining) [2022-10-15 16:43:34,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (170 of 354 remaining) [2022-10-15 16:43:34,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (169 of 354 remaining) [2022-10-15 16:43:34,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (168 of 354 remaining) [2022-10-15 16:43:34,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (167 of 354 remaining) [2022-10-15 16:43:34,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (166 of 354 remaining) [2022-10-15 16:43:34,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (165 of 354 remaining) [2022-10-15 16:43:34,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE (164 of 354 remaining) [2022-10-15 16:43:34,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE (163 of 354 remaining) [2022-10-15 16:43:34,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (162 of 354 remaining) [2022-10-15 16:43:34,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 354 remaining) [2022-10-15 16:43:34,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 354 remaining) [2022-10-15 16:43:34,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 354 remaining) [2022-10-15 16:43:34,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 354 remaining) [2022-10-15 16:43:34,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 354 remaining) [2022-10-15 16:43:34,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 354 remaining) [2022-10-15 16:43:34,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 354 remaining) [2022-10-15 16:43:34,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 354 remaining) [2022-10-15 16:43:34,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 354 remaining) [2022-10-15 16:43:34,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 354 remaining) [2022-10-15 16:43:34,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 354 remaining) [2022-10-15 16:43:34,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 354 remaining) [2022-10-15 16:43:34,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 354 remaining) [2022-10-15 16:43:34,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 354 remaining) [2022-10-15 16:43:34,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 354 remaining) [2022-10-15 16:43:34,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 354 remaining) [2022-10-15 16:43:34,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 354 remaining) [2022-10-15 16:43:34,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 354 remaining) [2022-10-15 16:43:34,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 354 remaining) [2022-10-15 16:43:34,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 354 remaining) [2022-10-15 16:43:34,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 354 remaining) [2022-10-15 16:43:34,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 354 remaining) [2022-10-15 16:43:34,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 354 remaining) [2022-10-15 16:43:34,896 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 354 remaining) [2022-10-15 16:43:34,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 354 remaining) [2022-10-15 16:43:34,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 354 remaining) [2022-10-15 16:43:34,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 354 remaining) [2022-10-15 16:43:34,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 354 remaining) [2022-10-15 16:43:34,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 354 remaining) [2022-10-15 16:43:34,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 354 remaining) [2022-10-15 16:43:34,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 354 remaining) [2022-10-15 16:43:34,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 354 remaining) [2022-10-15 16:43:34,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 354 remaining) [2022-10-15 16:43:34,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 354 remaining) [2022-10-15 16:43:34,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 354 remaining) [2022-10-15 16:43:34,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 354 remaining) [2022-10-15 16:43:34,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 354 remaining) [2022-10-15 16:43:34,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 354 remaining) [2022-10-15 16:43:34,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 354 remaining) [2022-10-15 16:43:34,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 354 remaining) [2022-10-15 16:43:34,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 354 remaining) [2022-10-15 16:43:34,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 354 remaining) [2022-10-15 16:43:34,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 354 remaining) [2022-10-15 16:43:34,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 354 remaining) [2022-10-15 16:43:34,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 354 remaining) [2022-10-15 16:43:34,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 354 remaining) [2022-10-15 16:43:34,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 354 remaining) [2022-10-15 16:43:34,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 354 remaining) [2022-10-15 16:43:34,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 354 remaining) [2022-10-15 16:43:34,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 354 remaining) [2022-10-15 16:43:34,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 354 remaining) [2022-10-15 16:43:34,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 354 remaining) [2022-10-15 16:43:34,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 354 remaining) [2022-10-15 16:43:34,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 354 remaining) [2022-10-15 16:43:34,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 354 remaining) [2022-10-15 16:43:34,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 354 remaining) [2022-10-15 16:43:34,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 354 remaining) [2022-10-15 16:43:34,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 354 remaining) [2022-10-15 16:43:34,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 354 remaining) [2022-10-15 16:43:34,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 354 remaining) [2022-10-15 16:43:34,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 354 remaining) [2022-10-15 16:43:34,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 354 remaining) [2022-10-15 16:43:34,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 354 remaining) [2022-10-15 16:43:34,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 354 remaining) [2022-10-15 16:43:34,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 354 remaining) [2022-10-15 16:43:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 354 remaining) [2022-10-15 16:43:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 354 remaining) [2022-10-15 16:43:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr166REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 354 remaining) [2022-10-15 16:43:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr167REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 354 remaining) [2022-10-15 16:43:34,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr168REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 354 remaining) [2022-10-15 16:43:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr169REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 354 remaining) [2022-10-15 16:43:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr170REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 354 remaining) [2022-10-15 16:43:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr171REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 354 remaining) [2022-10-15 16:43:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr172REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 354 remaining) [2022-10-15 16:43:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr173REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 354 remaining) [2022-10-15 16:43:34,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr174REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 354 remaining) [2022-10-15 16:43:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr175REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 354 remaining) [2022-10-15 16:43:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr176REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 354 remaining) [2022-10-15 16:43:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr177REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 354 remaining) [2022-10-15 16:43:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr178REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 354 remaining) [2022-10-15 16:43:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr179REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 354 remaining) [2022-10-15 16:43:34,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr180REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 354 remaining) [2022-10-15 16:43:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr181REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 354 remaining) [2022-10-15 16:43:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr182REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 354 remaining) [2022-10-15 16:43:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr183REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 354 remaining) [2022-10-15 16:43:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr184REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 354 remaining) [2022-10-15 16:43:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr185REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 354 remaining) [2022-10-15 16:43:34,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr186REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 354 remaining) [2022-10-15 16:43:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr187REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 354 remaining) [2022-10-15 16:43:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr188REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 354 remaining) [2022-10-15 16:43:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr189REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 354 remaining) [2022-10-15 16:43:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr190REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 354 remaining) [2022-10-15 16:43:34,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr191REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 354 remaining) [2022-10-15 16:43:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr192REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 354 remaining) [2022-10-15 16:43:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr193REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 354 remaining) [2022-10-15 16:43:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr194REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 354 remaining) [2022-10-15 16:43:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr195REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 354 remaining) [2022-10-15 16:43:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr196REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 354 remaining) [2022-10-15 16:43:34,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr197REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 354 remaining) [2022-10-15 16:43:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr198REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 354 remaining) [2022-10-15 16:43:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr199REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 354 remaining) [2022-10-15 16:43:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr200REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 354 remaining) [2022-10-15 16:43:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr201REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 354 remaining) [2022-10-15 16:43:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr202REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 354 remaining) [2022-10-15 16:43:34,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr203REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 354 remaining) [2022-10-15 16:43:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr204REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 354 remaining) [2022-10-15 16:43:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 354 remaining) [2022-10-15 16:43:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr206REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 354 remaining) [2022-10-15 16:43:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr207REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 354 remaining) [2022-10-15 16:43:34,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr208REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 354 remaining) [2022-10-15 16:43:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 354 remaining) [2022-10-15 16:43:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr210REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 354 remaining) [2022-10-15 16:43:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr211REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 354 remaining) [2022-10-15 16:43:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr212REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 354 remaining) [2022-10-15 16:43:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 354 remaining) [2022-10-15 16:43:34,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr214REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 354 remaining) [2022-10-15 16:43:34,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr215REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 354 remaining) [2022-10-15 16:43:34,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr216REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 354 remaining) [2022-10-15 16:43:34,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 354 remaining) [2022-10-15 16:43:34,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 354 remaining) [2022-10-15 16:43:34,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr219REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 354 remaining) [2022-10-15 16:43:34,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr220REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 354 remaining) [2022-10-15 16:43:34,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 354 remaining) [2022-10-15 16:43:34,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr222REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 354 remaining) [2022-10-15 16:43:34,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr223REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 354 remaining) [2022-10-15 16:43:34,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr224REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 354 remaining) [2022-10-15 16:43:34,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 354 remaining) [2022-10-15 16:43:34,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr226REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 354 remaining) [2022-10-15 16:43:34,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr227REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 354 remaining) [2022-10-15 16:43:34,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr228REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 354 remaining) [2022-10-15 16:43:34,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr229REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 354 remaining) [2022-10-15 16:43:34,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr230REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 354 remaining) [2022-10-15 16:43:34,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr231REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 354 remaining) [2022-10-15 16:43:34,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr232REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 354 remaining) [2022-10-15 16:43:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr233REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 354 remaining) [2022-10-15 16:43:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr234REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 354 remaining) [2022-10-15 16:43:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr235REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 354 remaining) [2022-10-15 16:43:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr236REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 354 remaining) [2022-10-15 16:43:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr237REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 354 remaining) [2022-10-15 16:43:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr238REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 354 remaining) [2022-10-15 16:43:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr239REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 354 remaining) [2022-10-15 16:43:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr240REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 354 remaining) [2022-10-15 16:43:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr241REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 354 remaining) [2022-10-15 16:43:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr242REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 354 remaining) [2022-10-15 16:43:34,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr243REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 354 remaining) [2022-10-15 16:43:34,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr244REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 354 remaining) [2022-10-15 16:43:34,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr245REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 354 remaining) [2022-10-15 16:43:34,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr246REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 354 remaining) [2022-10-15 16:43:34,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr247REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 354 remaining) [2022-10-15 16:43:34,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr248REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 354 remaining) [2022-10-15 16:43:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr249REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 354 remaining) [2022-10-15 16:43:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr250REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 354 remaining) [2022-10-15 16:43:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr251REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 354 remaining) [2022-10-15 16:43:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr252REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 354 remaining) [2022-10-15 16:43:34,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr253REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 354 remaining) [2022-10-15 16:43:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr254REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 354 remaining) [2022-10-15 16:43:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr255REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 354 remaining) [2022-10-15 16:43:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr256REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 354 remaining) [2022-10-15 16:43:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr257REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 354 remaining) [2022-10-15 16:43:34,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr258REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 354 remaining) [2022-10-15 16:43:34,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr259REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 354 remaining) [2022-10-15 16:43:34,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr261ASSERT_VIOLATIONMEMORY_LEAK (0 of 354 remaining) [2022-10-15 16:43:34,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:43:34,933 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:34,945 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:43:35,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:43:35 BoogieIcfgContainer [2022-10-15 16:43:35,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:43:35,026 INFO L158 Benchmark]: Toolchain (without parser) took 10931.51ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 134.0MB in the beginning and 202.2MB in the end (delta: -68.2MB). Peak memory consumption was 149.3MB. Max. memory is 8.0GB. [2022-10-15 16:43:35,027 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 161.5MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:43:35,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.74ms. Allocated memory is still 161.5MB. Free memory was 133.8MB in the beginning and 108.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-10-15 16:43:35,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.00ms. Allocated memory is still 161.5MB. Free memory was 108.2MB in the beginning and 137.1MB in the end (delta: -28.9MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2022-10-15 16:43:35,028 INFO L158 Benchmark]: Boogie Preprocessor took 203.88ms. Allocated memory is still 161.5MB. Free memory was 137.1MB in the beginning and 129.7MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-10-15 16:43:35,028 INFO L158 Benchmark]: RCFGBuilder took 2347.10ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 129.7MB in the beginning and 115.1MB in the end (delta: 14.7MB). Peak memory consumption was 87.0MB. Max. memory is 8.0GB. [2022-10-15 16:43:35,029 INFO L158 Benchmark]: TraceAbstraction took 7496.62ms. Allocated memory was 195.0MB in the beginning and 249.6MB in the end (delta: 54.5MB). Free memory was 114.5MB in the beginning and 202.2MB in the end (delta: -87.7MB). Peak memory consumption was 95.5MB. Max. memory is 8.0GB. [2022-10-15 16:43:35,031 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 161.5MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 735.74ms. Allocated memory is still 161.5MB. Free memory was 133.8MB in the beginning and 108.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 131.00ms. Allocated memory is still 161.5MB. Free memory was 108.2MB in the beginning and 137.1MB in the end (delta: -28.9MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 203.88ms. Allocated memory is still 161.5MB. Free memory was 137.1MB in the beginning and 129.7MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2347.10ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 129.7MB in the beginning and 115.1MB in the end (delta: 14.7MB). Peak memory consumption was 87.0MB. Max. memory is 8.0GB. * TraceAbstraction took 7496.62ms. Allocated memory was 195.0MB in the beginning and 249.6MB in the end (delta: 54.5MB). Free memory was 114.5MB in the beginning and 202.2MB in the end (delta: -87.7MB). Peak memory consumption was 95.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 662]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someUnaryDOUBLEoperation at line 657, overapproximation of bitwiseAnd at line 624, overapproximation of someBinaryArithmeticDOUBLEoperation at line 629, overapproximation of memtrack at line 662, overapproximation of someBinaryDOUBLEComparisonOperation at line 661. Possible FailurePath: [L22] static const double huge_floor = 1.0e300; [L108-L110] static const double two54_scalbn = 1.80143985094819840000e+16, twom54_scalbn = 5.55111512312578270212e-17, huge_scalbn = 1.0e+300, tiny_scalbn = 1.0e-300; [L179] static const int init_jk_krempio[] = {2, 3, 4, 6}; [L181-L186] static const double PIo2_krempio[] = { 1.57079625129699707031e+00, 7.54978941586159635335e-08, 5.39030252995776476554e-15, 3.28200341580791294123e-22, 1.27065575308067607349e-29, 1.22933308981111328932e-36, 2.73370053816464559624e-44, 2.16741683877804819444e-51, }; [L188-L190] static const double zero_krempio = 0.0, one_krempio = 1.0, two24_krempio = 1.67772160000000000000e+07, twon24_krempio = 5.96046447753906250000e-08; [L365-L376] static const __int32_t two_over_pi_rempio[] = { 0xA2F983, 0x6E4E44, 0x1529FC, 0x2757D1, 0xF534DD, 0xC0DB62, 0x95993C, 0x439041, 0xFE5163, 0xABDEBB, 0xC561B7, 0x246E3A, 0x424DD2, 0xE00649, 0x2EEA09, 0xD1921C, 0xFE1DEB, 0x1CB129, 0xA73EE8, 0x8235F5, 0x2EBB44, 0x84E99C, 0x7026B4, 0x5F7E41, 0x3991D6, 0x398353, 0x39F49C, 0x845F8B, 0xBDF928, 0x3B1FF8, 0x97FFDE, 0x05980F, 0xEF2F11, 0x8B5A0A, 0x6D1F6D, 0x367ECF, 0x27CB09, 0xB74F46, 0x3F669E, 0x5FEA2D, 0x7527BA, 0xC7EBE5, 0xF17B3D, 0x0739F7, 0x8A5292, 0xEA6BFB, 0x5FB11F, 0x8D5D08, 0x560330, 0x46FC7B, 0x6BABF0, 0xCFBC20, 0x9AF436, 0x1DA9E3, 0x91615E, 0xE61B08, 0x659985, 0x5F14A0, 0x68408D, 0xFFD880, 0x4D7327, 0x310606, 0x1556CA, 0x73A8C9, 0x60E27B, 0xC08C6B, }; [L378-L385] static const __int32_t npio2_hw_rempio[] = { 0x3FF921FB, 0x400921FB, 0x4012D97C, 0x401921FB, 0x401F6A7A, 0x4022D97C, 0x4025FDBB, 0x402921FB, 0x402C463A, 0x402F6A7A, 0x4031475C, 0x4032D97C, 0x40346B9C, 0x4035FDBB, 0x40378FDB, 0x403921FB, 0x403AB41B, 0x403C463A, 0x403DD85A, 0x403F6A7A, 0x40407E4C, 0x4041475C, 0x4042106C, 0x4042D97C, 0x4043A28C, 0x40446B9C, 0x404534AC, 0x4045FDBB, 0x4046C6CB, 0x40478FDB, 0x404858EB, 0x404921FB, }; [L387-L396] static const double zero_rempio = 0.00000000000000000000e+00, half_rempio = 5.00000000000000000000e-01, two24_rempio = 1.67772160000000000000e+07, invpio2_rempio = 6.36619772367581382433e-01, pio2_1_rempio = 1.57079632673412561417e+00, pio2_1t_rempio = 6.07710050650619224932e-11, pio2_2_rempio = 6.07710050630396597660e-11, pio2_2t_rempio = 2.02226624879595063154e-21, pio2_3_rempio = 2.02226624871116645580e-21, pio2_3t_rempio = 8.47842766036889956997e-32; [L529-L540] static const double one_ktan = 1.00000000000000000000e+00, pio4_ktan = 7.85398163397448278999e-01, pio4lo_ktan = 3.06161699786838301793e-17, T[] = { 3.33333333333334091986e-01, 1.33333333333201242699e-01, 5.39682539762260521377e-02, 2.18694882948595424599e-02, 8.86323982359930005737e-03, 3.59207910759131235356e-03, 1.45620945432529025516e-03, 5.88041240820264096874e-04, 2.46463134818469906812e-04, 7.81794442939557092300e-05, 7.14072491382608190305e-05, -1.85586374855275456654e-05, 2.59073051863633712884e-05, }; VAL [half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, npio2_hw_rempio={7:0}, one_krempio=1, one_ktan=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=785398163397448278999/1000000000000000000000, pio4lo_ktan=306161699786838301793/10000000000000000000000000000000000000, T={8:0}, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, zero_krempio=0, zero_rempio=0] [L657] double x = -0.0; [L658] CALL, EXPR tan_double(x) [L615] double y[2], z = 0.0; [L616] __int32_t n, ix; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, npio2_hw_rempio={7:0}, one_krempio=1, one_ktan=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=785398163397448278999/1000000000000000000000, pio4lo_ktan=306161699786838301793/10000000000000000000000000000000000000, T={8:0}, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L619] ieee_double_shape_type gh_u; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, gh_u={9:0}, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, npio2_hw_rempio={7:0}, one_krempio=1, one_ktan=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=785398163397448278999/1000000000000000000000, pio4lo_ktan=306161699786838301793/10000000000000000000000000000000000000, T={8:0}, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L620] gh_u.value = (x) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, gh_u={9:0}, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, npio2_hw_rempio={7:0}, one_krempio=1, one_ktan=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=785398163397448278999/1000000000000000000000, pio4lo_ktan=306161699786838301793/10000000000000000000000000000000000000, T={8:0}, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L621] EXPR gh_u.parts.msw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, gh_u={9:0}, gh_u.parts.msw=4294967295, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, npio2_hw_rempio={7:0}, one_krempio=1, one_ktan=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=785398163397448278999/1000000000000000000000, pio4lo_ktan=306161699786838301793/10000000000000000000000000000000000000, T={8:0}, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L621] (ix) = gh_u.parts.msw [L624] ix &= 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix=2146435072, npio2_hw_rempio={7:0}, one_krempio=1, one_ktan=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=785398163397448278999/1000000000000000000000, pio4lo_ktan=306161699786838301793/10000000000000000000000000000000000000, T={8:0}, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L625] COND FALSE !(ix <= 0x3fe921fb) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix=2146435072, npio2_hw_rempio={7:0}, one_krempio=1, one_ktan=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=785398163397448278999/1000000000000000000000, pio4lo_ktan=306161699786838301793/10000000000000000000000000000000000000, T={8:0}, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, y={10:0}, z=0, zero_krempio=0, zero_rempio=0] [L628] COND TRUE ix >= 0x7ff00000 [L629] return x - x; [L629] return x - x; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, ix=2146435072, npio2_hw_rempio={7:0}, one_krempio=1, one_ktan=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=785398163397448278999/1000000000000000000000, pio4lo_ktan=306161699786838301793/10000000000000000000000000000000000000, T={8:0}, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, z=0, zero_krempio=0, zero_rempio=0] [L658] RET, EXPR tan_double(x) [L658] double res = tan_double(x); [L661] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, npio2_hw_rempio={7:0}, one_krempio=1, one_ktan=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=785398163397448278999/1000000000000000000000, pio4lo_ktan=306161699786838301793/10000000000000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013, res == -0.0 && __signbit_double(res) == 1=0, T={8:0}, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, zero_krempio=0, zero_rempio=0] [L661] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L662] reach_error() VAL [half_rempio=1/2, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, huge_scalbn=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, init_jk_krempio={4:0}, invpio2_rempio=636619772367581382433/1000000000000000000000, npio2_hw_rempio={7:0}, one_krempio=1, one_ktan=1, pio2_1_rempio=157079632673412561417/100000000000000000000, pio2_1t_rempio=151927512662654806233/2500000000000000000000000000000, pio2_2_rempio=30385502531519829883/500000000000000000000000000000, pio2_2t_rempio=101113312439797531577/50000000000000000000000000000000000000000, pio2_3_rempio=10111331243555832279/5000000000000000000000000000000000000000, pio2_3t_rempio=847842766036889956997/10000000000000000000000000000000000000000000000000000, PIo2_krempio={5:0}, pio4_ktan=785398163397448278999/1000000000000000000000, pio4lo_ktan=306161699786838301793/10000000000000000000000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013, T={8:0}, tiny_scalbn=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, two24_krempio=16777216, two24_rempio=16777216, two54_scalbn=18014398509481984, two_over_pi_rempio={6:0}, twom54_scalbn=138777878078144567553/2500000000000000000000000000000000000, twon24_krempio=1/16777216, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014, zero_krempio=0, zero_rempio=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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: -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: 649]: 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 5 procedures, 859 locations, 354 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 13917 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5396 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3158 IncrementalHoareTripleChecker+Invalid, 3166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 8521 mSDtfsCounter, 3158 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=859occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-15 16:43:35,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...