/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_0682b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:43:46,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:43:46,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:43:46,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:43:46,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:43:46,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:43:46,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:43:46,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:43:46,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:43:46,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:43:46,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:43:46,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:43:46,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:43:46,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:43:46,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:43:46,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:43:46,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:43:46,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:43:46,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:43:46,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:43:46,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:43:46,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:43:46,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:43:46,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:43:46,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:43:46,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:43:46,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:43:46,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:43:46,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:43:46,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:43:46,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:43:46,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:43:46,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:43:46,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:43:46,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:43:46,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:43:46,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:43:46,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:43:46,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:43:46,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:43:46,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:43:46,368 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:46,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:43:46,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:43:46,426 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:43:46,426 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:43:46,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:43:46,428 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:43:46,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:43:46,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:43:46,432 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:43:46,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:43:46,433 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:43:46,433 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:43:46,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:43:46,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:43:46,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:43:46,434 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:43:46,434 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:43:46,435 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:43:46,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:43:46,435 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:43:46,435 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:43:46,435 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:43:46,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:43:46,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:43:46,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:43:46,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:43:46,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:43:46,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:43:46,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:43:46,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:43:46,437 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:46,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:43:46,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:43:46,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:43:46,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:43:46,860 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:43:46,862 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0682b.c [2022-10-15 16:43:46,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca3e311b/bbb1402a3d8344609a491046121ac2de/FLAG3b049121a [2022-10-15 16:43:47,724 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:43:47,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0682b.c [2022-10-15 16:43:47,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca3e311b/bbb1402a3d8344609a491046121ac2de/FLAG3b049121a [2022-10-15 16:43:48,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca3e311b/bbb1402a3d8344609a491046121ac2de [2022-10-15 16:43:48,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:43:48,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:43:48,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:43:48,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:43:48,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:43:48,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:43:48" (1/1) ... [2022-10-15 16:43:48,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9acd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:48, skipping insertion in model container [2022-10-15 16:43:48,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:43:48" (1/1) ... [2022-10-15 16:43:48,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:43:48,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:43:48,488 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_0682b.c[6873,6886] [2022-10-15 16:43:48,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:43:48,503 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:43:48,561 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_0682b.c[6873,6886] [2022-10-15 16:43:48,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:43:48,583 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:43:48,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:48 WrapperNode [2022-10-15 16:43:48,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:43:48,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:43:48,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:43:48,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:43:48,595 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:48" (1/1) ... [2022-10-15 16:43:48,619 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:48" (1/1) ... [2022-10-15 16:43:48,672 INFO L138 Inliner]: procedures = 21, calls = 98, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 313 [2022-10-15 16:43:48,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:43:48,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:43:48,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:43:48,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:43:48,686 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:48" (1/1) ... [2022-10-15 16:43:48,686 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:48" (1/1) ... [2022-10-15 16:43:48,694 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:48" (1/1) ... [2022-10-15 16:43:48,695 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:48" (1/1) ... [2022-10-15 16:43:48,723 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:48" (1/1) ... [2022-10-15 16:43:48,732 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:48" (1/1) ... [2022-10-15 16:43:48,737 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:48" (1/1) ... [2022-10-15 16:43:48,742 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:48" (1/1) ... [2022-10-15 16:43:48,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:43:48,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:43:48,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:43:48,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:43:48,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:48" (1/1) ... [2022-10-15 16:43:48,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:43:48,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:43:48,802 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:48,822 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:48,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:43:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:43:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:43:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:43:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:43:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-10-15 16:43:48,870 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-10-15 16:43:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:43:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-10-15 16:43:48,870 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-10-15 16:43:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:43:48,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:43:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:43:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:43:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:43:49,024 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:43:49,027 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:43:50,257 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:43:50,279 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:43:50,280 INFO L300 CfgBuilder]: Removed 20 assume(true) statements. [2022-10-15 16:43:50,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:43:50 BoogieIcfgContainer [2022-10-15 16:43:50,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:43:50,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:43:50,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:43:50,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:43:50,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:43:48" (1/3) ... [2022-10-15 16:43:50,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5dc6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:43:50, skipping insertion in model container [2022-10-15 16:43:50,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:48" (2/3) ... [2022-10-15 16:43:50,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5dc6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:43:50, skipping insertion in model container [2022-10-15 16:43:50,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:43:50" (3/3) ... [2022-10-15 16:43:50,297 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682b.c [2022-10-15 16:43:50,321 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:43:50,321 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2022-10-15 16:43:50,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:43:50,398 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;@bacc638, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:43:50,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2022-10-15 16:43:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 168 states have (on average 1.9702380952380953) internal successors, (331), 254 states have internal predecessors, (331), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:43:50,413 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:50,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:43:50,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash 7667333, now seen corresponding path program 1 times [2022-10-15 16:43:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:50,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183344120] [2022-10-15 16:43:50,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:50,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:50,802 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:50,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:50,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183344120] [2022-10-15 16:43:50,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183344120] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:50,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:50,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:50,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203727291] [2022-10-15 16:43:50,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:50,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:50,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:50,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:50,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:50,859 INFO L87 Difference]: Start difference. First operand has 261 states, 168 states have (on average 1.9702380952380953) internal successors, (331), 254 states have internal predecessors, (331), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:51,089 INFO L93 Difference]: Finished difference Result 258 states and 309 transitions. [2022-10-15 16:43:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:51,092 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:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:51,105 INFO L225 Difference]: With dead ends: 258 [2022-10-15 16:43:51,105 INFO L226 Difference]: Without dead ends: 256 [2022-10-15 16:43:51,107 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:51,112 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 7 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:51,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 502 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:43:51,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-10-15 16:43:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-10-15 16:43:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 167 states have (on average 1.7904191616766467) internal successors, (299), 249 states have internal predecessors, (299), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 307 transitions. [2022-10-15 16:43:51,209 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 307 transitions. Word has length 4 [2022-10-15 16:43:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:51,210 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 307 transitions. [2022-10-15 16:43:51,210 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:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 307 transitions. [2022-10-15 16:43:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:43:51,211 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:51,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:43:51,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:43:51,212 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:51,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash 7667334, now seen corresponding path program 1 times [2022-10-15 16:43:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:51,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204472718] [2022-10-15 16:43:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:51,460 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:51,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:51,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204472718] [2022-10-15 16:43:51,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204472718] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:51,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:51,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642741404] [2022-10-15 16:43:51,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:51,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:51,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:51,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:51,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:51,466 INFO L87 Difference]: Start difference. First operand 256 states and 307 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:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:51,622 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2022-10-15 16:43:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:51,622 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:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:51,625 INFO L225 Difference]: With dead ends: 253 [2022-10-15 16:43:51,625 INFO L226 Difference]: Without dead ends: 253 [2022-10-15 16:43:51,625 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:51,627 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 4 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:51,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 509 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-10-15 16:43:51,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2022-10-15 16:43:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 167 states have (on average 1.7724550898203593) internal successors, (296), 246 states have internal predecessors, (296), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 304 transitions. [2022-10-15 16:43:51,651 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 304 transitions. Word has length 4 [2022-10-15 16:43:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:51,652 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 304 transitions. [2022-10-15 16:43:51,652 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:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 304 transitions. [2022-10-15 16:43:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:43:51,653 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:51,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:51,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:43:51,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:51,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1977708684, now seen corresponding path program 1 times [2022-10-15 16:43:51,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:51,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578667965] [2022-10-15 16:43:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:52,012 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:52,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:52,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578667965] [2022-10-15 16:43:52,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578667965] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:52,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:52,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:52,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748924337] [2022-10-15 16:43:52,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:52,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:52,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:52,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:52,016 INFO L87 Difference]: Start difference. First operand 253 states and 304 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:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:52,167 INFO L93 Difference]: Finished difference Result 251 states and 302 transitions. [2022-10-15 16:43:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:52,168 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:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:52,170 INFO L225 Difference]: With dead ends: 251 [2022-10-15 16:43:52,170 INFO L226 Difference]: Without dead ends: 251 [2022-10-15 16:43:52,171 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:52,172 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 4 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:52,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 494 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-10-15 16:43:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2022-10-15 16:43:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 167 states have (on average 1.7604790419161678) internal successors, (294), 244 states have internal predecessors, (294), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 302 transitions. [2022-10-15 16:43:52,189 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 302 transitions. Word has length 14 [2022-10-15 16:43:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:52,189 INFO L495 AbstractCegarLoop]: Abstraction has 251 states and 302 transitions. [2022-10-15 16:43:52,189 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:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 302 transitions. [2022-10-15 16:43:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:43:52,190 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:52,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:52,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:43:52,191 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1977708683, now seen corresponding path program 1 times [2022-10-15 16:43:52,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:52,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471832532] [2022-10-15 16:43:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:52,478 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:52,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:52,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471832532] [2022-10-15 16:43:52,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471832532] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:52,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:52,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:52,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008877762] [2022-10-15 16:43:52,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:52,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:52,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:52,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:52,481 INFO L87 Difference]: Start difference. First operand 251 states and 302 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:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:52,614 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2022-10-15 16:43:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:52,615 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:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:52,617 INFO L225 Difference]: With dead ends: 249 [2022-10-15 16:43:52,617 INFO L226 Difference]: Without dead ends: 249 [2022-10-15 16:43:52,618 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:52,619 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 2 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:52,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 505 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-10-15 16:43:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-10-15 16:43:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 167 states have (on average 1.748502994011976) internal successors, (292), 242 states have internal predecessors, (292), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 300 transitions. [2022-10-15 16:43:52,632 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 300 transitions. Word has length 14 [2022-10-15 16:43:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:52,632 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 300 transitions. [2022-10-15 16:43:52,633 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:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 300 transitions. [2022-10-15 16:43:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:43:52,634 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:52,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:52,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:43:52,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:52,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1178371219, now seen corresponding path program 1 times [2022-10-15 16:43:52,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:52,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399251418] [2022-10-15 16:43:52,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:53,007 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:53,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:53,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399251418] [2022-10-15 16:43:53,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399251418] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:53,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:53,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:43:53,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417066515] [2022-10-15 16:43:53,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:53,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:43:53,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:53,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:43:53,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:43:53,011 INFO L87 Difference]: Start difference. First operand 249 states and 300 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:53,201 INFO L93 Difference]: Finished difference Result 253 states and 304 transitions. [2022-10-15 16:43:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:43:53,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-10-15 16:43:53,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:53,204 INFO L225 Difference]: With dead ends: 253 [2022-10-15 16:43:53,204 INFO L226 Difference]: Without dead ends: 251 [2022-10-15 16:43:53,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:43:53,206 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 2 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:53,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 683 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:43:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-10-15 16:43:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2022-10-15 16:43:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 168 states have (on average 1.744047619047619) internal successors, (293), 243 states have internal predecessors, (293), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 301 transitions. [2022-10-15 16:43:53,218 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 301 transitions. Word has length 15 [2022-10-15 16:43:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:53,218 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 301 transitions. [2022-10-15 16:43:53,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 301 transitions. [2022-10-15 16:43:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:43:53,219 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:53,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:53,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:43:53,220 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1178687922, now seen corresponding path program 1 times [2022-10-15 16:43:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:53,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238457274] [2022-10-15 16:43:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:53,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:53,309 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:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:53,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238457274] [2022-10-15 16:43:53,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238457274] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:53,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:53,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:43:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987776055] [2022-10-15 16:43:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:53,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:53,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:53,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:53,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:53,312 INFO L87 Difference]: Start difference. First operand 250 states and 301 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:53,324 INFO L93 Difference]: Finished difference Result 250 states and 300 transitions. [2022-10-15 16:43:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:53,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-10-15 16:43:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:53,327 INFO L225 Difference]: With dead ends: 250 [2022-10-15 16:43:53,328 INFO L226 Difference]: Without dead ends: 249 [2022-10-15 16:43:53,328 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:53,332 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:53,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:43:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-10-15 16:43:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-10-15 16:43:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 167 states have (on average 1.7425149700598803) internal successors, (291), 242 states have internal predecessors, (291), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 299 transitions. [2022-10-15 16:43:53,348 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 299 transitions. Word has length 15 [2022-10-15 16:43:53,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:53,349 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 299 transitions. [2022-10-15 16:43:53,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 299 transitions. [2022-10-15 16:43:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:43:53,350 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:53,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:53,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:43:53,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:53,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash -736311806, now seen corresponding path program 1 times [2022-10-15 16:43:53,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:53,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327919219] [2022-10-15 16:43:53,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:54,011 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:54,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:54,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327919219] [2022-10-15 16:43:54,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327919219] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:54,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:54,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:43:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236538389] [2022-10-15 16:43:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:54,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:43:54,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:54,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:43:54,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:43:54,015 INFO L87 Difference]: Start difference. First operand 249 states and 299 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:54,247 INFO L93 Difference]: Finished difference Result 251 states and 300 transitions. [2022-10-15 16:43:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:43:54,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:43:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:54,253 INFO L225 Difference]: With dead ends: 251 [2022-10-15 16:43:54,253 INFO L226 Difference]: Without dead ends: 249 [2022-10-15 16:43:54,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:43:54,258 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 1 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:54,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 869 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:43:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-10-15 16:43:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-10-15 16:43:54,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 167 states have (on average 1.7365269461077844) internal successors, (290), 242 states have internal predecessors, (290), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 298 transitions. [2022-10-15 16:43:54,269 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 298 transitions. Word has length 22 [2022-10-15 16:43:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:54,274 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 298 transitions. [2022-10-15 16:43:54,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 298 transitions. [2022-10-15 16:43:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:43:54,276 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:54,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:54,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:43:54,277 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash -736628509, now seen corresponding path program 1 times [2022-10-15 16:43:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:54,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862873210] [2022-10-15 16:43:54,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:54,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:54,494 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:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:54,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862873210] [2022-10-15 16:43:54,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862873210] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:54,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:54,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417796431] [2022-10-15 16:43:54,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:54,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:54,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:54,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:54,497 INFO L87 Difference]: Start difference. First operand 249 states and 298 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:54,623 INFO L93 Difference]: Finished difference Result 246 states and 295 transitions. [2022-10-15 16:43:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:54,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:43:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:54,626 INFO L225 Difference]: With dead ends: 246 [2022-10-15 16:43:54,626 INFO L226 Difference]: Without dead ends: 246 [2022-10-15 16:43:54,627 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:54,627 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 7 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:54,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 479 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-10-15 16:43:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-10-15 16:43:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 167 states have (on average 1.718562874251497) internal successors, (287), 239 states have internal predecessors, (287), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 295 transitions. [2022-10-15 16:43:54,638 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 295 transitions. Word has length 22 [2022-10-15 16:43:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:54,638 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 295 transitions. [2022-10-15 16:43:54,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 295 transitions. [2022-10-15 16:43:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:43:54,639 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:54,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:54,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:43:54,640 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash -736628508, now seen corresponding path program 1 times [2022-10-15 16:43:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:54,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730240712] [2022-10-15 16:43:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:54,911 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:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:54,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730240712] [2022-10-15 16:43:54,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730240712] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:54,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:54,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488366000] [2022-10-15 16:43:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:54,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:54,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:54,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:54,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:54,914 INFO L87 Difference]: Start difference. First operand 246 states and 295 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:55,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:55,046 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2022-10-15 16:43:55,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:55,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:43:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:55,049 INFO L225 Difference]: With dead ends: 243 [2022-10-15 16:43:55,049 INFO L226 Difference]: Without dead ends: 243 [2022-10-15 16:43:55,049 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:55,050 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 4 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:55,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 490 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-10-15 16:43:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2022-10-15 16:43:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 167 states have (on average 1.7005988023952097) internal successors, (284), 236 states have internal predecessors, (284), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 292 transitions. [2022-10-15 16:43:55,059 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 292 transitions. Word has length 22 [2022-10-15 16:43:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:55,060 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 292 transitions. [2022-10-15 16:43:55,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 292 transitions. [2022-10-15 16:43:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:43:55,061 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:55,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:55,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:43:55,062 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:55,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:55,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1634410703, now seen corresponding path program 1 times [2022-10-15 16:43:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:55,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232564838] [2022-10-15 16:43:55,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:55,244 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:55,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:55,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232564838] [2022-10-15 16:43:55,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232564838] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:55,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:55,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787719940] [2022-10-15 16:43:55,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:55,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:55,247 INFO L87 Difference]: Start difference. First operand 243 states and 292 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:55,402 INFO L93 Difference]: Finished difference Result 240 states and 289 transitions. [2022-10-15 16:43:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-15 16:43:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:55,405 INFO L225 Difference]: With dead ends: 240 [2022-10-15 16:43:55,406 INFO L226 Difference]: Without dead ends: 240 [2022-10-15 16:43:55,406 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:55,407 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 7 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:55,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 470 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-10-15 16:43:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-10-15 16:43:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 167 states have (on average 1.6826347305389222) internal successors, (281), 233 states have internal predecessors, (281), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 289 transitions. [2022-10-15 16:43:55,417 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 289 transitions. Word has length 30 [2022-10-15 16:43:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:55,417 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 289 transitions. [2022-10-15 16:43:55,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 289 transitions. [2022-10-15 16:43:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:43:55,419 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:55,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:55,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:43:55,420 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1634410702, now seen corresponding path program 1 times [2022-10-15 16:43:55,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:55,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746849308] [2022-10-15 16:43:55,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:55,729 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:55,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:55,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746849308] [2022-10-15 16:43:55,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746849308] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:55,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:55,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:55,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766349895] [2022-10-15 16:43:55,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:55,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:55,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:55,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:55,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:55,733 INFO L87 Difference]: Start difference. First operand 240 states and 289 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:55,882 INFO L93 Difference]: Finished difference Result 237 states and 286 transitions. [2022-10-15 16:43:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:55,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-15 16:43:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:55,886 INFO L225 Difference]: With dead ends: 237 [2022-10-15 16:43:55,886 INFO L226 Difference]: Without dead ends: 237 [2022-10-15 16:43:55,886 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:55,887 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 4 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:55,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 481 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:55,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-10-15 16:43:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2022-10-15 16:43:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 167 states have (on average 1.6646706586826348) internal successors, (278), 230 states have internal predecessors, (278), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:43:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 286 transitions. [2022-10-15 16:43:55,904 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 286 transitions. Word has length 30 [2022-10-15 16:43:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:55,905 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 286 transitions. [2022-10-15 16:43:55,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 286 transitions. [2022-10-15 16:43:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 16:43:55,912 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:55,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:55,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:43:55,913 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-10-15 16:43:55,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:55,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1185096326, now seen corresponding path program 1 times [2022-10-15 16:43:55,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:55,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199295060] [2022-10-15 16:43:55,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:55,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:43:56,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:43:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:43:56,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:43:56,694 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:43:56,695 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (85 of 86 remaining) [2022-10-15 16:43:56,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 86 remaining) [2022-10-15 16:43:56,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 86 remaining) [2022-10-15 16:43:56,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 86 remaining) [2022-10-15 16:43:56,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 86 remaining) [2022-10-15 16:43:56,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 86 remaining) [2022-10-15 16:43:56,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 86 remaining) [2022-10-15 16:43:56,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 86 remaining) [2022-10-15 16:43:56,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 86 remaining) [2022-10-15 16:43:56,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 86 remaining) [2022-10-15 16:43:56,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 86 remaining) [2022-10-15 16:43:56,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 86 remaining) [2022-10-15 16:43:56,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 86 remaining) [2022-10-15 16:43:56,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 86 remaining) [2022-10-15 16:43:56,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 86 remaining) [2022-10-15 16:43:56,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 86 remaining) [2022-10-15 16:43:56,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 86 remaining) [2022-10-15 16:43:56,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 86 remaining) [2022-10-15 16:43:56,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 86 remaining) [2022-10-15 16:43:56,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 86 remaining) [2022-10-15 16:43:56,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 86 remaining) [2022-10-15 16:43:56,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 86 remaining) [2022-10-15 16:43:56,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 86 remaining) [2022-10-15 16:43:56,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 86 remaining) [2022-10-15 16:43:56,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 86 remaining) [2022-10-15 16:43:56,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 86 remaining) [2022-10-15 16:43:56,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 86 remaining) [2022-10-15 16:43:56,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 86 remaining) [2022-10-15 16:43:56,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 86 remaining) [2022-10-15 16:43:56,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 86 remaining) [2022-10-15 16:43:56,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 86 remaining) [2022-10-15 16:43:56,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 86 remaining) [2022-10-15 16:43:56,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 86 remaining) [2022-10-15 16:43:56,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 86 remaining) [2022-10-15 16:43:56,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 86 remaining) [2022-10-15 16:43:56,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 86 remaining) [2022-10-15 16:43:56,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 86 remaining) [2022-10-15 16:43:56,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 86 remaining) [2022-10-15 16:43:56,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 86 remaining) [2022-10-15 16:43:56,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 86 remaining) [2022-10-15 16:43:56,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 86 remaining) [2022-10-15 16:43:56,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 86 remaining) [2022-10-15 16:43:56,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 86 remaining) [2022-10-15 16:43:56,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 86 remaining) [2022-10-15 16:43:56,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 86 remaining) [2022-10-15 16:43:56,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 86 remaining) [2022-10-15 16:43:56,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 86 remaining) [2022-10-15 16:43:56,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 86 remaining) [2022-10-15 16:43:56,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 86 remaining) [2022-10-15 16:43:56,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 86 remaining) [2022-10-15 16:43:56,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 86 remaining) [2022-10-15 16:43:56,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 86 remaining) [2022-10-15 16:43:56,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 86 remaining) [2022-10-15 16:43:56,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 86 remaining) [2022-10-15 16:43:56,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 86 remaining) [2022-10-15 16:43:56,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 86 remaining) [2022-10-15 16:43:56,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 86 remaining) [2022-10-15 16:43:56,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 86 remaining) [2022-10-15 16:43:56,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 86 remaining) [2022-10-15 16:43:56,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 86 remaining) [2022-10-15 16:43:56,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 86 remaining) [2022-10-15 16:43:56,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 86 remaining) [2022-10-15 16:43:56,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 86 remaining) [2022-10-15 16:43:56,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 86 remaining) [2022-10-15 16:43:56,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 86 remaining) [2022-10-15 16:43:56,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 86 remaining) [2022-10-15 16:43:56,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 86 remaining) [2022-10-15 16:43:56,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 86 remaining) [2022-10-15 16:43:56,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 86 remaining) [2022-10-15 16:43:56,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 86 remaining) [2022-10-15 16:43:56,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 86 remaining) [2022-10-15 16:43:56,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 86 remaining) [2022-10-15 16:43:56,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 86 remaining) [2022-10-15 16:43:56,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 86 remaining) [2022-10-15 16:43:56,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 86 remaining) [2022-10-15 16:43:56,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 86 remaining) [2022-10-15 16:43:56,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 86 remaining) [2022-10-15 16:43:56,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 86 remaining) [2022-10-15 16:43:56,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 86 remaining) [2022-10-15 16:43:56,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 86 remaining) [2022-10-15 16:43:56,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 86 remaining) [2022-10-15 16:43:56,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 86 remaining) [2022-10-15 16:43:56,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 86 remaining) [2022-10-15 16:43:56,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 86 remaining) [2022-10-15 16:43:56,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 86 remaining) [2022-10-15 16:43:56,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (0 of 86 remaining) [2022-10-15 16:43:56,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:43:56,721 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:56,725 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:43:56,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:43:56 BoogieIcfgContainer [2022-10-15 16:43:56,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:43:56,801 INFO L158 Benchmark]: Toolchain (without parser) took 8772.58ms. Allocated memory was 153.1MB in the beginning and 256.9MB in the end (delta: 103.8MB). Free memory was 128.4MB in the beginning and 191.8MB in the end (delta: -63.5MB). Peak memory consumption was 150.9MB. Max. memory is 8.0GB. [2022-10-15 16:43:56,801 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 153.1MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:43:56,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.04ms. Allocated memory is still 153.1MB. Free memory was 128.2MB in the beginning and 112.9MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 16:43:56,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.85ms. Allocated memory is still 153.1MB. Free memory was 112.9MB in the beginning and 107.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-15 16:43:56,802 INFO L158 Benchmark]: Boogie Preprocessor took 78.15ms. Allocated memory is still 153.1MB. Free memory was 107.8MB in the beginning and 103.3MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-10-15 16:43:56,803 INFO L158 Benchmark]: RCFGBuilder took 1532.11ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 84.5MB in the end (delta: 18.8MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. [2022-10-15 16:43:56,803 INFO L158 Benchmark]: TraceAbstraction took 6511.58ms. Allocated memory was 153.1MB in the beginning and 256.9MB in the end (delta: 103.8MB). Free memory was 83.5MB in the beginning and 191.8MB in the end (delta: -108.4MB). Peak memory consumption was 106.1MB. Max. memory is 8.0GB. [2022-10-15 16:43:56,805 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 153.1MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 548.04ms. Allocated memory is still 153.1MB. Free memory was 128.2MB in the beginning and 112.9MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.85ms. Allocated memory is still 153.1MB. Free memory was 112.9MB in the beginning and 107.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.15ms. Allocated memory is still 153.1MB. Free memory was 107.8MB in the beginning and 103.3MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1532.11ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 84.5MB in the end (delta: 18.8MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6511.58ms. Allocated memory was 153.1MB in the beginning and 256.9MB in the end (delta: 103.8MB). Free memory was 83.5MB in the beginning and 191.8MB in the end (delta: -108.4MB). Peak memory consumption was 106.1MB. 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: 287]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseOr at line 164, overapproximation of someUnaryDOUBLEoperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 165, overapproximation of bitwiseAnd at line 268, overapproximation of memtrack at line 287, overapproximation of someBinaryDOUBLEComparisonOperation at line 286. Possible FailurePath: [L39-L44] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L46-L51] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L53-L60] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L62-L64] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L141-L142] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L278] double x = -1.0 / 0.0; [L279] double y = __VERIFIER_nondet_double(); [L281] CALL, EXPR isinf_double(x) [L248] __int32_t hx, lx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, zero_atan2=0] [L250] ieee_double_shape_type ew_u; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, zero_atan2=0] [L251] ew_u.value = (x) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, zero_atan2=0] [L252] EXPR ew_u.parts.msw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={9:0}, ew_u.parts.msw=4294967293, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, zero_atan2=0] [L252] (hx) = ew_u.parts.msw [L253] EXPR ew_u.parts.lsw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={9:0}, ew_u.parts.lsw=4294967294, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-3, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, zero_atan2=0] [L253] (lx) = ew_u.parts.lsw [L255] hx &= 0x7fffffff [L256] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L257] hx = 0x7ff00000 - hx [L258] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-1, lx=-2, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, zero_atan2=0] [L281] RET, EXPR isinf_double(x) [L281] EXPR isinf_double(x) && isfinite_double(y) [L281] CALL, EXPR isfinite_double(y) [L262] __int32_t hx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L264] ieee_double_shape_type gh_u; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gh_u={10:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L265] gh_u.value = (x) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gh_u={10:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L266] EXPR gh_u.parts.msw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gh_u={10:0}, gh_u.parts.msw=4294967309, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L266] (hx) = gh_u.parts.msw [L268] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=13, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L281] RET, EXPR isfinite_double(y) [L281] EXPR isinf_double(x) && isfinite_double(y) VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isfinite_double(y)=1, isinf_double(x)=1, isinf_double(x) && isfinite_double(y)=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L281] COND TRUE isinf_double(x) && isfinite_double(y) && y > 0.0 [L283] CALL, EXPR __ieee754_atan2(y, x) [L145] double z; [L146] __int32_t k, m, hx, hy, ix, iy; [L147] __uint32_t lx, ly; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L150] ieee_double_shape_type ew_u; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={11:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L151] ew_u.value = (x) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={11:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L152] EXPR ew_u.parts.msw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={11:0}, ew_u.parts.msw=4294967296, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L152] (hx) = ew_u.parts.msw [L153] EXPR ew_u.parts.lsw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={11:0}, ew_u.parts.lsw=1, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L153] (lx) = ew_u.parts.lsw [L155] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L157] ieee_double_shape_type ew_u; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={7:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L158] ew_u.value = (y) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={7:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L159] EXPR ew_u.parts.msw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={7:0}, ew_u.parts.msw=-4294967296, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, lx=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L159] (hy) = ew_u.parts.msw [L160] EXPR ew_u.parts.lsw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={7:0}, ew_u.parts.lsw=0, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, lx=1, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L160] (ly) = ew_u.parts.lsw [L162] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=1, ly=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L163-L164] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L165] return x + y; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, hy=0, ix=0, iy=0, lx=1, ly=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L283] RET, EXPR __ieee754_atan2(y, x) [L283] double res = __ieee754_atan2(y, x); [L286] COND TRUE res != pi VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=0] [L287] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003, zero_atan2=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: 271]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 261 locations, 86 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 6075 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2857 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1295 IncrementalHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 3218 mSDtfsCounter, 1295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:43:56,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...