/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_0683b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:43:46,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:43:46,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:43:46,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:43:46,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:43:46,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:43:46,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:43:46,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:43:46,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:43:46,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:43:46,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:43:46,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:43:46,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:43:46,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:43:46,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:43:46,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:43:46,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:43:46,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:43:46,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:43:46,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:43:46,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:43:46,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:43:46,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:43:46,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:43:46,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:43:46,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:43:46,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:43:46,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:43:46,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:43:46,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:43:46,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:43:46,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:43:46,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:43:46,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:43:46,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:43:46,916 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:43:46,917 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:43:46,917 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:43:46,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:43:46,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:43:46,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:43:46,924 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,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:43:46,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:43:46,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:43:46,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:43:46,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:43:46,962 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:43:46,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:43:46,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:43:46,963 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:43:46,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:43:46,963 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:43:46,964 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:43:46,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:43:46,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:43:46,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:43:46,964 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:43:46,965 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:43:46,965 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:43:46,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:43:46,965 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:43:46,965 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:43:46,966 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:43:46,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:43:46,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:43:46,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:43:46,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:43:46,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:43:46,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:43:46,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:43:46,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:43:46,968 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:47,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:43:47,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:43:47,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:43:47,448 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:43:47,448 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:43:47,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0683b.c [2022-10-15 16:43:47,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60fa71495/040c86ec78b4416092c7fcbbcdec56d8/FLAGb82cbecd3 [2022-10-15 16:43:48,141 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:43:48,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0683b.c [2022-10-15 16:43:48,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60fa71495/040c86ec78b4416092c7fcbbcdec56d8/FLAGb82cbecd3 [2022-10-15 16:43:48,473 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60fa71495/040c86ec78b4416092c7fcbbcdec56d8 [2022-10-15 16:43:48,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:43:48,483 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:43:48,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:43:48,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:43:48,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:43:48,497 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,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79db3256 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,499 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,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:43:48,564 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:43:48,819 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_0683b.c[7144,7157] [2022-10-15 16:43:48,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:43:48,835 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:43:48,906 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_0683b.c[7144,7157] [2022-10-15 16:43:48,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:43:48,932 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:43:48,932 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,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:43:48,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:43:48,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:43:48,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:43:48,943 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,962 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:49,027 INFO L138 Inliner]: procedures = 22, calls = 103, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 337 [2022-10-15 16:43:49,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:43:49,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:43:49,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:43:49,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:43:49,042 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:49,042 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:49,051 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:49,052 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:49,081 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:49,090 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:49,098 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:49,111 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:49,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:43:49,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:43:49,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:43:49,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:43:49,130 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:49,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:43:49,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:43:49,170 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:49,200 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:49,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:43:49,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:43:49,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:43:49,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:43:49,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:43:49,266 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2022-10-15 16:43:49,267 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2022-10-15 16:43:49,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:43:49,267 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2022-10-15 16:43:49,268 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2022-10-15 16:43:49,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:43:49,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:43:49,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:43:49,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:43:49,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:43:49,438 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:43:49,441 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:43:50,522 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:43:50,534 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:43:50,535 INFO L300 CfgBuilder]: Removed 22 assume(true) statements. [2022-10-15 16:43:50,538 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,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:43:50,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:43:50,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:43:50,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:43:50,547 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,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb16478 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,548 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,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb16478 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,549 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,551 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0683b.c [2022-10-15 16:43:50,578 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:43:50,578 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 90 error locations. [2022-10-15 16:43:50,653 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:43:50,663 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;@27ad7d30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:43:50,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2022-10-15 16:43:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 273 states, 176 states have (on average 1.9659090909090908) internal successors, (346), 266 states have internal predecessors, (346), 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,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:43:50,679 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:50,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:43:50,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 7667333, now seen corresponding path program 1 times [2022-10-15 16:43:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:50,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136829021] [2022-10-15 16:43:50,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:50,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:51,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:51,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136829021] [2022-10-15 16:43:51,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136829021] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:51,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:51,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:51,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123857042] [2022-10-15 16:43:51,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:51,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:51,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:51,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:51,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:51,095 INFO L87 Difference]: Start difference. First operand has 273 states, 176 states have (on average 1.9659090909090908) internal successors, (346), 266 states have internal predecessors, (346), 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,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:51,367 INFO L93 Difference]: Finished difference Result 270 states and 322 transitions. [2022-10-15 16:43:51,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:51,370 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,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:51,384 INFO L225 Difference]: With dead ends: 270 [2022-10-15 16:43:51,385 INFO L226 Difference]: Without dead ends: 268 [2022-10-15 16:43:51,387 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,393 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 7 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:51,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 522 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:43:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-10-15 16:43:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-10-15 16:43:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 175 states have (on average 1.782857142857143) internal successors, (312), 261 states have internal predecessors, (312), 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,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 320 transitions. [2022-10-15 16:43:51,495 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 320 transitions. Word has length 4 [2022-10-15 16:43:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:51,496 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 320 transitions. [2022-10-15 16:43:51,496 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,499 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 320 transitions. [2022-10-15 16:43:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:43:51,500 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:51,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:43:51,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:43:51,501 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:51,502 INFO L85 PathProgramCache]: Analyzing trace with hash 7667334, now seen corresponding path program 1 times [2022-10-15 16:43:51,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:51,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552032379] [2022-10-15 16:43:51,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:51,751 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,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:51,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552032379] [2022-10-15 16:43:51,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552032379] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:51,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:51,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:51,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004044335] [2022-10-15 16:43:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:51,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:51,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:51,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:51,756 INFO L87 Difference]: Start difference. First operand 268 states and 320 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,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:51,992 INFO L93 Difference]: Finished difference Result 265 states and 317 transitions. [2022-10-15 16:43:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:51,992 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,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:51,995 INFO L225 Difference]: With dead ends: 265 [2022-10-15 16:43:51,996 INFO L226 Difference]: Without dead ends: 265 [2022-10-15 16:43:52,001 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,005 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 4 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:52,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 530 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:43:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-10-15 16:43:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-10-15 16:43:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 175 states have (on average 1.7657142857142858) internal successors, (309), 258 states have internal predecessors, (309), 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,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 317 transitions. [2022-10-15 16:43:52,053 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 317 transitions. Word has length 4 [2022-10-15 16:43:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:52,053 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 317 transitions. [2022-10-15 16:43:52,053 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:52,054 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 317 transitions. [2022-10-15 16:43:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:43:52,056 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:52,056 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,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:43:52,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:52,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1977708684, now seen corresponding path program 1 times [2022-10-15 16:43:52,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:52,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330986282] [2022-10-15 16:43:52,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:52,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:52,387 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,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330986282] [2022-10-15 16:43:52,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330986282] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:52,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:52,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:52,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246307652] [2022-10-15 16:43:52,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:52,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:52,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:52,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:52,391 INFO L87 Difference]: Start difference. First operand 265 states and 317 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,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:52,563 INFO L93 Difference]: Finished difference Result 263 states and 315 transitions. [2022-10-15 16:43:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:52,564 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,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:52,566 INFO L225 Difference]: With dead ends: 263 [2022-10-15 16:43:52,566 INFO L226 Difference]: Without dead ends: 263 [2022-10-15 16:43:52,569 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,577 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 4 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:52,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 514 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:43:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-10-15 16:43:52,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-10-15 16:43:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 175 states have (on average 1.7542857142857142) internal successors, (307), 256 states have internal predecessors, (307), 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,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 315 transitions. [2022-10-15 16:43:52,598 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 315 transitions. Word has length 14 [2022-10-15 16:43:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:52,598 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 315 transitions. [2022-10-15 16:43:52,598 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,599 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 315 transitions. [2022-10-15 16:43:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:43:52,599 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:52,599 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,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:43:52,602 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:52,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1977708683, now seen corresponding path program 1 times [2022-10-15 16:43:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:52,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164423390] [2022-10-15 16:43:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:52,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:52,944 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,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:52,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164423390] [2022-10-15 16:43:52,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164423390] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:52,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:52,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:52,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805584786] [2022-10-15 16:43:52,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:52,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:52,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:52,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:52,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:52,947 INFO L87 Difference]: Start difference. First operand 263 states and 315 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:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:53,105 INFO L93 Difference]: Finished difference Result 261 states and 313 transitions. [2022-10-15 16:43:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:53,106 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:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:53,108 INFO L225 Difference]: With dead ends: 261 [2022-10-15 16:43:53,108 INFO L226 Difference]: Without dead ends: 261 [2022-10-15 16:43:53,109 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:53,110 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 2 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:53,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 526 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-10-15 16:43:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-10-15 16:43:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 175 states have (on average 1.7428571428571429) internal successors, (305), 254 states have internal predecessors, (305), 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,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 313 transitions. [2022-10-15 16:43:53,122 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 313 transitions. Word has length 14 [2022-10-15 16:43:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:53,122 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 313 transitions. [2022-10-15 16:43:53,123 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:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 313 transitions. [2022-10-15 16:43:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:43:53,124 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:53,124 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,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:43:53,124 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:53,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1178343415, now seen corresponding path program 1 times [2022-10-15 16:43:53,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:53,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179028158] [2022-10-15 16:43:53,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:53,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:53,448 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,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:53,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179028158] [2022-10-15 16:43:53,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179028158] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:53,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:53,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:43:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411589941] [2022-10-15 16:43:53,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:53,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:43:53,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:53,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:43:53,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:43:53,451 INFO L87 Difference]: Start difference. First operand 261 states and 313 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,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:53,657 INFO L93 Difference]: Finished difference Result 265 states and 317 transitions. [2022-10-15 16:43:53,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:43:53,657 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,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:53,659 INFO L225 Difference]: With dead ends: 265 [2022-10-15 16:43:53,659 INFO L226 Difference]: Without dead ends: 263 [2022-10-15 16:43:53,660 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,661 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 2 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:53,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 710 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:43:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-10-15 16:43:53,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2022-10-15 16:43:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 176 states have (on average 1.7386363636363635) internal successors, (306), 255 states have internal predecessors, (306), 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,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 314 transitions. [2022-10-15 16:43:53,671 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 314 transitions. Word has length 15 [2022-10-15 16:43:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:53,671 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 314 transitions. [2022-10-15 16:43:53,671 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,672 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 314 transitions. [2022-10-15 16:43:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:43:53,672 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:53,673 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,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:43:53,673 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:53,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:53,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1178687922, now seen corresponding path program 1 times [2022-10-15 16:43:53,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:53,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395434789] [2022-10-15 16:43:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:53,766 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,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:53,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395434789] [2022-10-15 16:43:53,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395434789] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:53,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:53,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:43:53,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153486616] [2022-10-15 16:43:53,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:53,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:53,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:53,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:53,770 INFO L87 Difference]: Start difference. First operand 262 states and 314 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,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:53,782 INFO L93 Difference]: Finished difference Result 262 states and 313 transitions. [2022-10-15 16:43:53,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:53,783 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,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:53,785 INFO L225 Difference]: With dead ends: 262 [2022-10-15 16:43:53,785 INFO L226 Difference]: Without dead ends: 261 [2022-10-15 16:43:53,785 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,786 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 0 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 619 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,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 619 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,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-10-15 16:43:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-10-15 16:43:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 175 states have (on average 1.737142857142857) internal successors, (304), 254 states have internal predecessors, (304), 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,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 312 transitions. [2022-10-15 16:43:53,796 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 312 transitions. Word has length 15 [2022-10-15 16:43:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:53,796 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 312 transitions. [2022-10-15 16:43:53,796 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,797 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 312 transitions. [2022-10-15 16:43:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:43:53,797 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:53,797 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,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:43:53,798 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash -736284002, now seen corresponding path program 1 times [2022-10-15 16:43:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:53,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087243443] [2022-10-15 16:43:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:53,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:54,302 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,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:54,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087243443] [2022-10-15 16:43:54,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087243443] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:54,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:54,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:43:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270149641] [2022-10-15 16:43:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:54,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:43:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:43:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:43:54,305 INFO L87 Difference]: Start difference. First operand 261 states and 312 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,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:54,599 INFO L93 Difference]: Finished difference Result 263 states and 313 transitions. [2022-10-15 16:43:54,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:43:54,600 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,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:54,602 INFO L225 Difference]: With dead ends: 263 [2022-10-15 16:43:54,602 INFO L226 Difference]: Without dead ends: 261 [2022-10-15 16:43:54,602 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,603 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 1 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:54,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 903 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:43:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-10-15 16:43:54,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2022-10-15 16:43:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 175 states have (on average 1.7314285714285715) internal successors, (303), 254 states have internal predecessors, (303), 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,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 311 transitions. [2022-10-15 16:43:54,612 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 311 transitions. Word has length 22 [2022-10-15 16:43:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:54,613 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 311 transitions. [2022-10-15 16:43:54,613 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,613 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 311 transitions. [2022-10-15 16:43:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:43:54,614 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:54,614 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,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:43:54,615 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash -736628509, now seen corresponding path program 1 times [2022-10-15 16:43:54,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:54,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217138873] [2022-10-15 16:43:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:54,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:54,768 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,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:54,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217138873] [2022-10-15 16:43:54,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217138873] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:54,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:54,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:54,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837963707] [2022-10-15 16:43:54,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:54,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:54,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:54,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:54,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:54,771 INFO L87 Difference]: Start difference. First operand 261 states and 311 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,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:54,913 INFO L93 Difference]: Finished difference Result 258 states and 308 transitions. [2022-10-15 16:43:54,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:54,914 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,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:54,916 INFO L225 Difference]: With dead ends: 258 [2022-10-15 16:43:54,916 INFO L226 Difference]: Without dead ends: 258 [2022-10-15 16:43:54,917 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,918 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 7 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:54,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 499 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:54,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-10-15 16:43:54,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-10-15 16:43:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 175 states have (on average 1.7142857142857142) internal successors, (300), 251 states have internal predecessors, (300), 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,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 308 transitions. [2022-10-15 16:43:54,928 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 308 transitions. Word has length 22 [2022-10-15 16:43:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:54,928 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 308 transitions. [2022-10-15 16:43:54,928 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,929 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 308 transitions. [2022-10-15 16:43:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:43:54,929 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:54,930 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,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:43:54,930 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash -736628508, now seen corresponding path program 1 times [2022-10-15 16:43:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:54,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570362409] [2022-10-15 16:43:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:55,192 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,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:55,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570362409] [2022-10-15 16:43:55,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570362409] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:55,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:55,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:55,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440448346] [2022-10-15 16:43:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:55,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:55,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:55,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:55,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:55,195 INFO L87 Difference]: Start difference. First operand 258 states and 308 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,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:55,359 INFO L93 Difference]: Finished difference Result 255 states and 305 transitions. [2022-10-15 16:43:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:55,359 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,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:55,361 INFO L225 Difference]: With dead ends: 255 [2022-10-15 16:43:55,362 INFO L226 Difference]: Without dead ends: 255 [2022-10-15 16:43:55,362 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,363 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 4 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 511 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.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:55,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 511 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:43:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-10-15 16:43:55,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2022-10-15 16:43:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 175 states have (on average 1.697142857142857) internal successors, (297), 248 states have internal predecessors, (297), 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,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 305 transitions. [2022-10-15 16:43:55,372 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 305 transitions. Word has length 22 [2022-10-15 16:43:55,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:55,373 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 305 transitions. [2022-10-15 16:43:55,373 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,373 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 305 transitions. [2022-10-15 16:43:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:43:55,374 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:55,374 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,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:43:55,375 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1634410703, now seen corresponding path program 1 times [2022-10-15 16:43:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:55,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114338733] [2022-10-15 16:43:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:55,564 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,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:55,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114338733] [2022-10-15 16:43:55,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114338733] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:55,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:55,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:55,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771485122] [2022-10-15 16:43:55,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:55,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:55,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:55,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:55,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:55,567 INFO L87 Difference]: Start difference. First operand 255 states and 305 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,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:55,699 INFO L93 Difference]: Finished difference Result 252 states and 302 transitions. [2022-10-15 16:43:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:55,700 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,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:55,702 INFO L225 Difference]: With dead ends: 252 [2022-10-15 16:43:55,702 INFO L226 Difference]: Without dead ends: 252 [2022-10-15 16:43:55,702 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,703 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 7 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:55,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 490 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-10-15 16:43:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-10-15 16:43:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 175 states have (on average 1.68) internal successors, (294), 245 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:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 302 transitions. [2022-10-15 16:43:55,711 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 302 transitions. Word has length 30 [2022-10-15 16:43:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:55,712 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 302 transitions. [2022-10-15 16:43:55,712 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,712 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 302 transitions. [2022-10-15 16:43:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:43:55,713 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:55,713 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,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:43:55,714 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:55,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1634410702, now seen corresponding path program 1 times [2022-10-15 16:43:55,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:55,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824203468] [2022-10-15 16:43:55,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:55,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:56,023 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:56,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:56,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824203468] [2022-10-15 16:43:56,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824203468] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:56,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:56,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730995052] [2022-10-15 16:43:56,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:56,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:56,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:56,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:56,027 INFO L87 Difference]: Start difference. First operand 252 states and 302 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:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:56,173 INFO L93 Difference]: Finished difference Result 249 states and 299 transitions. [2022-10-15 16:43:56,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:56,174 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:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:56,176 INFO L225 Difference]: With dead ends: 249 [2022-10-15 16:43:56,176 INFO L226 Difference]: Without dead ends: 249 [2022-10-15 16:43:56,177 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:56,178 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 4 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:56,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 502 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-10-15 16:43:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-10-15 16:43:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 175 states have (on average 1.6628571428571428) 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:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 299 transitions. [2022-10-15 16:43:56,187 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 299 transitions. Word has length 30 [2022-10-15 16:43:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:56,188 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 299 transitions. [2022-10-15 16:43:56,188 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:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 299 transitions. [2022-10-15 16:43:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-15 16:43:56,190 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:56,190 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, 1] [2022-10-15 16:43:56,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:43:56,191 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2022-10-15 16:43:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:56,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1916744079, now seen corresponding path program 1 times [2022-10-15 16:43:56,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:56,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925442750] [2022-10-15 16:43:56,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:56,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:43:56,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:43:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:43:56,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:43:56,893 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:43:56,895 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (89 of 90 remaining) [2022-10-15 16:43:56,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 90 remaining) [2022-10-15 16:43:56,897 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 90 remaining) [2022-10-15 16:43:56,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 90 remaining) [2022-10-15 16:43:56,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 90 remaining) [2022-10-15 16:43:56,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 90 remaining) [2022-10-15 16:43:56,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 90 remaining) [2022-10-15 16:43:56,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 90 remaining) [2022-10-15 16:43:56,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 90 remaining) [2022-10-15 16:43:56,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 90 remaining) [2022-10-15 16:43:56,899 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_doubleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 90 remaining) [2022-10-15 16:43:56,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 90 remaining) [2022-10-15 16:43:56,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 90 remaining) [2022-10-15 16:43:56,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 90 remaining) [2022-10-15 16:43:56,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 90 remaining) [2022-10-15 16:43:56,900 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 90 remaining) [2022-10-15 16:43:56,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 90 remaining) [2022-10-15 16:43:56,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 90 remaining) [2022-10-15 16:43:56,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 90 remaining) [2022-10-15 16:43:56,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 90 remaining) [2022-10-15 16:43:56,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 90 remaining) [2022-10-15 16:43:56,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 90 remaining) [2022-10-15 16:43:56,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 90 remaining) [2022-10-15 16:43:56,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 90 remaining) [2022-10-15 16:43:56,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 90 remaining) [2022-10-15 16:43:56,902 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 90 remaining) [2022-10-15 16:43:56,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 90 remaining) [2022-10-15 16:43:56,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 90 remaining) [2022-10-15 16:43:56,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 90 remaining) [2022-10-15 16:43:56,903 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 90 remaining) [2022-10-15 16:43:56,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 90 remaining) [2022-10-15 16:43:56,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 90 remaining) [2022-10-15 16:43:56,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 90 remaining) [2022-10-15 16:43:56,904 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 90 remaining) [2022-10-15 16:43:56,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 90 remaining) [2022-10-15 16:43:56,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 90 remaining) [2022-10-15 16:43:56,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 90 remaining) [2022-10-15 16:43:56,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 90 remaining) [2022-10-15 16:43:56,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 90 remaining) [2022-10-15 16:43:56,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 90 remaining) [2022-10-15 16:43:56,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 90 remaining) [2022-10-15 16:43:56,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 90 remaining) [2022-10-15 16:43:56,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 90 remaining) [2022-10-15 16:43:56,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 90 remaining) [2022-10-15 16:43:56,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 90 remaining) [2022-10-15 16:43:56,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 90 remaining) [2022-10-15 16:43:56,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 90 remaining) [2022-10-15 16:43:56,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 90 remaining) [2022-10-15 16:43:56,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 90 remaining) [2022-10-15 16:43:56,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 90 remaining) [2022-10-15 16:43:56,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 90 remaining) [2022-10-15 16:43:56,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 90 remaining) [2022-10-15 16:43:56,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_doubleErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 90 remaining) [2022-10-15 16:43:56,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 90 remaining) [2022-10-15 16:43:56,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 90 remaining) [2022-10-15 16:43:56,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 90 remaining) [2022-10-15 16:43:56,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 90 remaining) [2022-10-15 16:43:56,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 90 remaining) [2022-10-15 16:43:56,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 90 remaining) [2022-10-15 16:43:56,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 90 remaining) [2022-10-15 16:43:56,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 90 remaining) [2022-10-15 16:43:56,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 90 remaining) [2022-10-15 16:43:56,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 90 remaining) [2022-10-15 16:43:56,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 90 remaining) [2022-10-15 16:43:56,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 90 remaining) [2022-10-15 16:43:56,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 90 remaining) [2022-10-15 16:43:56,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 90 remaining) [2022-10-15 16:43:56,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 90 remaining) [2022-10-15 16:43:56,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 90 remaining) [2022-10-15 16:43:56,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 90 remaining) [2022-10-15 16:43:56,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 90 remaining) [2022-10-15 16:43:56,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 90 remaining) [2022-10-15 16:43:56,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 90 remaining) [2022-10-15 16:43:56,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 90 remaining) [2022-10-15 16:43:56,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 90 remaining) [2022-10-15 16:43:56,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 90 remaining) [2022-10-15 16:43:56,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 90 remaining) [2022-10-15 16:43:56,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 90 remaining) [2022-10-15 16:43:56,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 90 remaining) [2022-10-15 16:43:56,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 90 remaining) [2022-10-15 16:43:56,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 90 remaining) [2022-10-15 16:43:56,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 90 remaining) [2022-10-15 16:43:56,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 90 remaining) [2022-10-15 16:43:56,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 90 remaining) [2022-10-15 16:43:56,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 90 remaining) [2022-10-15 16:43:56,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 90 remaining) [2022-10-15 16:43:56,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 90 remaining) [2022-10-15 16:43:56,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 90 remaining) [2022-10-15 16:43:56,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 90 remaining) [2022-10-15 16:43:56,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 90 remaining) [2022-10-15 16:43:56,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:43:56,921 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:56,926 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:43:57,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:43:57 BoogieIcfgContainer [2022-10-15 16:43:57,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:43:57,023 INFO L158 Benchmark]: Toolchain (without parser) took 8544.40ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 124.9MB in the beginning and 185.8MB in the end (delta: -60.9MB). Peak memory consumption was 127.8MB. Max. memory is 8.0GB. [2022-10-15 16:43:57,023 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:43:57,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.96ms. Allocated memory is still 151.0MB. Free memory was 124.8MB in the beginning and 109.9MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 16:43:57,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.04ms. Allocated memory is still 151.0MB. Free memory was 109.8MB in the beginning and 104.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-10-15 16:43:57,025 INFO L158 Benchmark]: Boogie Preprocessor took 96.85ms. Allocated memory is still 151.0MB. Free memory was 104.6MB in the beginning and 100.0MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-10-15 16:43:57,026 INFO L158 Benchmark]: RCFGBuilder took 1410.16ms. Allocated memory is still 151.0MB. Free memory was 100.0MB in the beginning and 127.2MB in the end (delta: -27.3MB). Peak memory consumption was 27.1MB. Max. memory is 8.0GB. [2022-10-15 16:43:57,027 INFO L158 Benchmark]: TraceAbstraction took 6480.29ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 126.7MB in the beginning and 185.8MB in the end (delta: -59.1MB). Peak memory consumption was 129.0MB. Max. memory is 8.0GB. [2022-10-15 16:43:57,029 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.32ms. Allocated memory is still 125.8MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 443.96ms. Allocated memory is still 151.0MB. Free memory was 124.8MB in the beginning and 109.9MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 96.04ms. Allocated memory is still 151.0MB. Free memory was 109.8MB in the beginning and 104.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 96.85ms. Allocated memory is still 151.0MB. Free memory was 104.6MB in the beginning and 100.0MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1410.16ms. Allocated memory is still 151.0MB. Free memory was 100.0MB in the beginning and 127.2MB in the end (delta: -27.3MB). Peak memory consumption was 27.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6480.29ms. Allocated memory was 151.0MB in the beginning and 222.3MB in the end (delta: 71.3MB). Free memory was 126.7MB in the beginning and 185.8MB in the end (delta: -59.1MB). Peak memory consumption was 129.0MB. 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: 300]: 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 300, overapproximation of someBinaryDOUBLEComparisonOperation at line 299. 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] [L291] double x = 1.0 / 0.0; [L292] double y = __VERIFIER_nondet_double(); [L294] CALL, EXPR isinf_double(x) [L248] __int32_t hx, lx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, zero_atan2=0] [L250] ieee_double_shape_type ew_u; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, zero_atan2=0] [L251] ew_u.value = (x) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, zero_atan2=0] [L252] EXPR ew_u.parts.msw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={9:0}, ew_u.parts.msw=8589934590, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, zero_atan2=0] [L252] (hx) = ew_u.parts.msw [L253] EXPR ew_u.parts.lsw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={9:0}, ew_u.parts.lsw=4294967297, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, 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)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2146435071, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, zero_atan2=0] [L294] RET, EXPR isinf_double(x) [L294] EXPR isinf_double(x) && isfinite_double(y) [L294] CALL, EXPR isfinite_double(y) [L262] __int32_t hx; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L264] ieee_double_shape_type gh_u; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L265] gh_u.value = (x) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L266] EXPR gh_u.parts.msw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gh_u={10:0}, gh_u.parts.msw=4294967295, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L266] (hx) = gh_u.parts.msw [L268] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=-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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L294] RET, EXPR isfinite_double(y) [L294] 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L294] COND TRUE isinf_double(x) && isfinite_double(y) && y > 0.0 [L296] 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)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L150] ieee_double_shape_type ew_u; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L151] ew_u.value = (x) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L152] EXPR ew_u.parts.msw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={11:0}, ew_u.parts.msw=8589934592, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L152] (hx) = ew_u.parts.msw [L153] EXPR ew_u.parts.lsw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L153] (lx) = ew_u.parts.lsw [L155] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L157] ieee_double_shape_type ew_u; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L158] ew_u.value = (y) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L159] EXPR ew_u.parts.msw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L159] (hy) = ew_u.parts.msw [L160] EXPR ew_u.parts.lsw VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, ew_u={7:0}, ew_u.parts.lsw=1, 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L160] (ly) = ew_u.parts.lsw [L162] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L163-L164] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L165] return x + y; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, \old(y)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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=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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L296] RET, EXPR __ieee754_atan2(y, x) [L296] double res = __ieee754_atan2(y, x); [L299] EXPR res == 0.0 && __signbit_double(res) == 0 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, res == 0.0 && __signbit_double(res) == 0=0, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, zero_atan2=0] [L299] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L300] 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=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017, y=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019, 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 283]: 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, 273 locations, 90 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 6326 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2965 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1369 IncrementalHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 3361 mSDtfsCounter, 1369 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.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred 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.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 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:57,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...