/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/float_req_bl_0686a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:17,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:17,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:17,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:17,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:17,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:17,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:17,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:17,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:17,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:17,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:17,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:17,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:17,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:17,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:17,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:17,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:17,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:17,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:17,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:17,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:17,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:17,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:17,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:17,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:17,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:17,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:17,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:17,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:17,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:17,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:17,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:17,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:17,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:17,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:17,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:17,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:17,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:17,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:17,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:17,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:17,244 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:45:17,280 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:17,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:17,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:17,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:17,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:17,282 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:17,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:17,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:17,284 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:17,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:17,284 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:17,284 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:17,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:17,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:17,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:17,285 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:17,285 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:17,286 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:17,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:17,286 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:17,286 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:17,287 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:17,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:17,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:17,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:17,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:17,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:17,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:17,288 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:17,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:17,289 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:45:17,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:17,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:17,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:17,780 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:17,781 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:17,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0686a.c [2022-10-15 16:45:17,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7115c7f/84a0a305ab1b437aa0139474f533e670/FLAG98ad5dca1 [2022-10-15 16:45:18,591 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:18,591 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0686a.c [2022-10-15 16:45:18,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7115c7f/84a0a305ab1b437aa0139474f533e670/FLAG98ad5dca1 [2022-10-15 16:45:18,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7115c7f/84a0a305ab1b437aa0139474f533e670 [2022-10-15 16:45:18,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:18,899 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:18,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:18,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:18,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:18,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:18" (1/1) ... [2022-10-15 16:45:18,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec6fe5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:18, skipping insertion in model container [2022-10-15 16:45:18,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:18" (1/1) ... [2022-10-15 16:45:18,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:18,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:19,358 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/float_req_bl_0686a.c[5265,5278] [2022-10-15 16:45:19,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:19,378 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:19,437 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/float_req_bl_0686a.c[5265,5278] [2022-10-15 16:45:19,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:19,485 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:19,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19 WrapperNode [2022-10-15 16:45:19,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:19,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:19,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:19,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:19,506 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:45:19" (1/1) ... [2022-10-15 16:45:19,535 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:45:19" (1/1) ... [2022-10-15 16:45:19,602 INFO L138 Inliner]: procedures = 19, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2022-10-15 16:45:19,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:19,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:19,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:19,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:19,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19" (1/1) ... [2022-10-15 16:45:19,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19" (1/1) ... [2022-10-15 16:45:19,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19" (1/1) ... [2022-10-15 16:45:19,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19" (1/1) ... [2022-10-15 16:45:19,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19" (1/1) ... [2022-10-15 16:45:19,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19" (1/1) ... [2022-10-15 16:45:19,706 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19" (1/1) ... [2022-10-15 16:45:19,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19" (1/1) ... [2022-10-15 16:45:19,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:19,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:19,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:19,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:19,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19" (1/1) ... [2022-10-15 16:45:19,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:19,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:19,776 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:45:19,790 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:45:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-10-15 16:45:19,854 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-10-15 16:45:19,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:19,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:45:19,855 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-10-15 16:45:19,855 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-10-15 16:45:19,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:20,072 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:20,075 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:21,290 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:21,307 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:21,308 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-10-15 16:45:21,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:21 BoogieIcfgContainer [2022-10-15 16:45:21,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:21,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:21,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:21,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:21,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:18" (1/3) ... [2022-10-15 16:45:21,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a03a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:21, skipping insertion in model container [2022-10-15 16:45:21,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:19" (2/3) ... [2022-10-15 16:45:21,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a03a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:21, skipping insertion in model container [2022-10-15 16:45:21,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:21" (3/3) ... [2022-10-15 16:45:21,325 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0686a.c [2022-10-15 16:45:21,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:21,354 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-10-15 16:45:21,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:21,438 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;@59cabe8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:21,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-10-15 16:45:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 138 states have (on average 1.963768115942029) internal successors, (271), 202 states have internal predecessors, (271), 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:45:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:21,457 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:21,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:21,458 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-10-15 16:45:21,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2156997, now seen corresponding path program 1 times [2022-10-15 16:45:21,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:21,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917783168] [2022-10-15 16:45:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:21,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:21,975 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:45:21,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:21,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917783168] [2022-10-15 16:45:21,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917783168] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:21,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:21,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:21,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964795771] [2022-10-15 16:45:21,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:21,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:21,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:22,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:22,031 INFO L87 Difference]: Start difference. First operand has 209 states, 138 states have (on average 1.963768115942029) internal successors, (271), 202 states have internal predecessors, (271), 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:45:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:22,251 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2022-10-15 16:45:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:22,254 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:45:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:22,272 INFO L225 Difference]: With dead ends: 207 [2022-10-15 16:45:22,273 INFO L226 Difference]: Without dead ends: 205 [2022-10-15 16:45:22,275 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:45:22,284 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 4 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:22,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 427 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-10-15 16:45:22,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-10-15 16:45:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 137 states have (on average 1.7956204379562044) internal successors, (246), 198 states have internal predecessors, (246), 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:45:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 254 transitions. [2022-10-15 16:45:22,358 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 254 transitions. Word has length 4 [2022-10-15 16:45:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:22,359 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 254 transitions. [2022-10-15 16:45:22,359 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:45:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 254 transitions. [2022-10-15 16:45:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:22,360 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:22,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:22,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:22,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-10-15 16:45:22,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:22,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2156998, now seen corresponding path program 1 times [2022-10-15 16:45:22,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:22,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570331559] [2022-10-15 16:45:22,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:22,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:22,597 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:45:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:22,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570331559] [2022-10-15 16:45:22,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570331559] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:22,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:22,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890454271] [2022-10-15 16:45:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:22,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:22,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:22,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:22,602 INFO L87 Difference]: Start difference. First operand 205 states and 254 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:45:22,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:22,794 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2022-10-15 16:45:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:22,795 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:45:22,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:22,799 INFO L225 Difference]: With dead ends: 203 [2022-10-15 16:45:22,799 INFO L226 Difference]: Without dead ends: 203 [2022-10-15 16:45:22,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:22,807 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:22,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 431 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-10-15 16:45:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-10-15 16:45:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 137 states have (on average 1.781021897810219) internal successors, (244), 196 states have internal predecessors, (244), 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:45:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 252 transitions. [2022-10-15 16:45:22,864 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 252 transitions. Word has length 4 [2022-10-15 16:45:22,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:22,865 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 252 transitions. [2022-10-15 16:45:22,866 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:45:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 252 transitions. [2022-10-15 16:45:22,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:45:22,868 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:22,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:22,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:22,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-10-15 16:45:22,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:22,874 INFO L85 PathProgramCache]: Analyzing trace with hash -861169776, now seen corresponding path program 1 times [2022-10-15 16:45:22,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:22,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368893012] [2022-10-15 16:45:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:23,047 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:45:23,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:23,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368893012] [2022-10-15 16:45:23,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368893012] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:23,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:23,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:23,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885763691] [2022-10-15 16:45:23,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:23,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:23,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:23,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:23,051 INFO L87 Difference]: Start difference. First operand 203 states and 252 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:45:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:23,185 INFO L93 Difference]: Finished difference Result 201 states and 250 transitions. [2022-10-15 16:45:23,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:23,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-10-15 16:45:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:23,188 INFO L225 Difference]: With dead ends: 201 [2022-10-15 16:45:23,188 INFO L226 Difference]: Without dead ends: 201 [2022-10-15 16:45:23,189 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:45:23,190 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 4 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:23,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 418 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-10-15 16:45:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-10-15 16:45:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 137 states have (on average 1.7664233576642336) internal successors, (242), 194 states have internal predecessors, (242), 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:45:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions. [2022-10-15 16:45:23,204 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 10 [2022-10-15 16:45:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:23,205 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 250 transitions. [2022-10-15 16:45:23,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:45:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2022-10-15 16:45:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:45:23,206 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:23,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:23,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:23,207 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-10-15 16:45:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash -861169775, now seen corresponding path program 1 times [2022-10-15 16:45:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:23,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932530667] [2022-10-15 16:45:23,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:23,330 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:45:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:23,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932530667] [2022-10-15 16:45:23,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932530667] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:23,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:23,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:23,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613658178] [2022-10-15 16:45:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:23,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:23,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:23,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:23,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:23,334 INFO L87 Difference]: Start difference. First operand 201 states and 250 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:45:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:23,471 INFO L93 Difference]: Finished difference Result 199 states and 248 transitions. [2022-10-15 16:45:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:23,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-10-15 16:45:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:23,474 INFO L225 Difference]: With dead ends: 199 [2022-10-15 16:45:23,475 INFO L226 Difference]: Without dead ends: 199 [2022-10-15 16:45:23,475 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:45:23,477 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 2 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:23,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 425 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-10-15 16:45:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-10-15 16:45:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 137 states have (on average 1.7518248175182483) internal successors, (240), 192 states have internal predecessors, (240), 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:45:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 248 transitions. [2022-10-15 16:45:23,517 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 248 transitions. Word has length 10 [2022-10-15 16:45:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:23,518 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 248 transitions. [2022-10-15 16:45:23,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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:45:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 248 transitions. [2022-10-15 16:45:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:45:23,519 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:23,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:23,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:23,520 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-10-15 16:45:23,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:23,521 INFO L85 PathProgramCache]: Analyzing trace with hash -350308589, now seen corresponding path program 1 times [2022-10-15 16:45:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:23,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109841402] [2022-10-15 16:45:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:23,628 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:45:23,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:23,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109841402] [2022-10-15 16:45:23,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109841402] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:23,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:23,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:45:23,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589737524] [2022-10-15 16:45:23,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:23,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:45:23,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:23,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:45:23,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:23,632 INFO L87 Difference]: Start difference. First operand 199 states and 248 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:45:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:23,676 INFO L93 Difference]: Finished difference Result 248 states and 316 transitions. [2022-10-15 16:45:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:45:23,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2022-10-15 16:45:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:23,679 INFO L225 Difference]: With dead ends: 248 [2022-10-15 16:45:23,679 INFO L226 Difference]: Without dead ends: 248 [2022-10-15 16:45:23,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:23,681 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 85 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:23,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 515 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:23,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-10-15 16:45:23,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2022-10-15 16:45:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 167 states have (on average 1.7245508982035929) internal successors, (288), 222 states have internal predecessors, (288), 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:45:23,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2022-10-15 16:45:23,696 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 18 [2022-10-15 16:45:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:23,697 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2022-10-15 16:45:23,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:45:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-10-15 16:45:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 16:45:23,699 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:23,699 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] [2022-10-15 16:45:23,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:23,700 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting atan_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-10-15 16:45:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1772668671, now seen corresponding path program 1 times [2022-10-15 16:45:23,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:23,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153742137] [2022-10-15 16:45:23,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:23,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:23,800 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:45:23,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:23,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153742137] [2022-10-15 16:45:23,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153742137] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:23,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:23,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:23,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899214474] [2022-10-15 16:45:23,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:23,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:23,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:23,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:23,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:23,804 INFO L87 Difference]: Start difference. First operand 229 states and 296 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:23,846 INFO L93 Difference]: Finished difference Result 235 states and 296 transitions. [2022-10-15 16:45:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:23,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 16:45:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:23,849 INFO L225 Difference]: With dead ends: 235 [2022-10-15 16:45:23,849 INFO L226 Difference]: Without dead ends: 235 [2022-10-15 16:45:23,850 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:45:23,851 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 33 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:23,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 472 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-10-15 16:45:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2022-10-15 16:45:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 165 states have (on average 1.696969696969697) internal successors, (280), 220 states have internal predecessors, (280), 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:45:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 288 transitions. [2022-10-15 16:45:23,861 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 288 transitions. Word has length 20 [2022-10-15 16:45:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:23,861 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 288 transitions. [2022-10-15 16:45:23,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 288 transitions. [2022-10-15 16:45:23,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 16:45:23,863 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:23,863 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] [2022-10-15 16:45:23,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:45:23,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-10-15 16:45:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2012323568, now seen corresponding path program 1 times [2022-10-15 16:45:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:23,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833659755] [2022-10-15 16:45:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:23,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:23,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:45:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:23,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:45:23,963 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:45:23,965 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (63 of 64 remaining) [2022-10-15 16:45:23,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 64 remaining) [2022-10-15 16:45:23,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 64 remaining) [2022-10-15 16:45:23,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 64 remaining) [2022-10-15 16:45:23,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 64 remaining) [2022-10-15 16:45:23,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 64 remaining) [2022-10-15 16:45:23,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 64 remaining) [2022-10-15 16:45:23,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 64 remaining) [2022-10-15 16:45:23,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 64 remaining) [2022-10-15 16:45:23,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 64 remaining) [2022-10-15 16:45:23,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 64 remaining) [2022-10-15 16:45:23,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 64 remaining) [2022-10-15 16:45:23,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 64 remaining) [2022-10-15 16:45:23,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 64 remaining) [2022-10-15 16:45:23,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 64 remaining) [2022-10-15 16:45:23,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 64 remaining) [2022-10-15 16:45:23,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 64 remaining) [2022-10-15 16:45:23,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 64 remaining) [2022-10-15 16:45:23,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 64 remaining) [2022-10-15 16:45:23,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 64 remaining) [2022-10-15 16:45:23,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 64 remaining) [2022-10-15 16:45:23,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 64 remaining) [2022-10-15 16:45:23,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 64 remaining) [2022-10-15 16:45:23,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 64 remaining) [2022-10-15 16:45:23,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 64 remaining) [2022-10-15 16:45:23,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (38 of 64 remaining) [2022-10-15 16:45:23,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 64 remaining) [2022-10-15 16:45:23,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 64 remaining) [2022-10-15 16:45:23,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 64 remaining) [2022-10-15 16:45:23,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 64 remaining) [2022-10-15 16:45:23,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 64 remaining) [2022-10-15 16:45:23,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 64 remaining) [2022-10-15 16:45:23,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 64 remaining) [2022-10-15 16:45:23,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 64 remaining) [2022-10-15 16:45:23,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 64 remaining) [2022-10-15 16:45:23,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 64 remaining) [2022-10-15 16:45:23,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 64 remaining) [2022-10-15 16:45:23,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 64 remaining) [2022-10-15 16:45:23,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 64 remaining) [2022-10-15 16:45:23,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 64 remaining) [2022-10-15 16:45:23,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 64 remaining) [2022-10-15 16:45:23,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 64 remaining) [2022-10-15 16:45:23,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 64 remaining) [2022-10-15 16:45:23,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 64 remaining) [2022-10-15 16:45:23,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 64 remaining) [2022-10-15 16:45:23,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 64 remaining) [2022-10-15 16:45:23,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 64 remaining) [2022-10-15 16:45:23,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 64 remaining) [2022-10-15 16:45:23,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 64 remaining) [2022-10-15 16:45:23,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 64 remaining) [2022-10-15 16:45:23,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 64 remaining) [2022-10-15 16:45:23,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 64 remaining) [2022-10-15 16:45:23,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 64 remaining) [2022-10-15 16:45:23,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 64 remaining) [2022-10-15 16:45:23,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 64 remaining) [2022-10-15 16:45:23,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 64 remaining) [2022-10-15 16:45:23,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 64 remaining) [2022-10-15 16:45:23,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 64 remaining) [2022-10-15 16:45:23,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 64 remaining) [2022-10-15 16:45:23,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 64 remaining) [2022-10-15 16:45:23,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 64 remaining) [2022-10-15 16:45:23,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 64 remaining) [2022-10-15 16:45:23,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 64 remaining) [2022-10-15 16:45:23,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 64 remaining) [2022-10-15 16:45:23,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:45:23,988 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:23,994 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:45:24,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:45:24 BoogieIcfgContainer [2022-10-15 16:45:24,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:45:24,084 INFO L158 Benchmark]: Toolchain (without parser) took 5190.21ms. Allocated memory is still 151.0MB. Free memory was 124.9MB in the beginning and 74.1MB in the end (delta: 50.8MB). Peak memory consumption was 51.5MB. Max. memory is 8.0GB. [2022-10-15 16:45:24,085 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:24,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.19ms. Allocated memory is still 151.0MB. Free memory was 124.7MB in the beginning and 111.1MB in the end (delta: 13.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:45:24,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.58ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 108.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:24,089 INFO L158 Benchmark]: Boogie Preprocessor took 119.29ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 105.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:24,089 INFO L158 Benchmark]: RCFGBuilder took 1584.28ms. Allocated memory is still 151.0MB. Free memory was 105.7MB in the beginning and 70.2MB in the end (delta: 35.5MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-10-15 16:45:24,089 INFO L158 Benchmark]: TraceAbstraction took 2767.87ms. Allocated memory is still 151.0MB. Free memory was 69.3MB in the beginning and 74.1MB in the end (delta: -4.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:24,092 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.30ms. Allocated memory is still 151.0MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 584.19ms. Allocated memory is still 151.0MB. Free memory was 124.7MB in the beginning and 111.1MB in the end (delta: 13.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 113.58ms. Allocated memory is still 151.0MB. Free memory was 110.9MB in the beginning and 108.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 119.29ms. Allocated memory is still 151.0MB. Free memory was 108.4MB in the beginning and 105.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1584.28ms. Allocated memory is still 151.0MB. Free memory was 105.7MB in the beginning and 70.2MB in the end (delta: 35.5MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2767.87ms. Allocated memory is still 151.0MB. Free memory was 69.3MB in the beginning and 74.1MB in the end (delta: -4.8MB). There was no memory consumed. 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: 230]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 229, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of memtrack at line 230, overapproximation of someBinaryArithmeticFLOAToperation at line 137. Possible FailurePath: [L29-L34] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L36-L41] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L43-L47] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L49-L51] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L117-L118] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L223] float x = 1.0f / 0.0f; [L224] float y = 1.0f / 0.0f; [L226] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000013, \old(y)=1000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L125] ieee_float_shape_type gf_u; VAL [\old(x)=1000000000000000000000000000013, \old(y)=1000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={9:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L126] gf_u.value = (x) VAL [\old(x)=1000000000000000000000000000013, \old(y)=1000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={9:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L127] EXPR gf_u.word VAL [\old(x)=1000000000000000000000000000013, \old(y)=1000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={9:0}, gf_u.word=4294967296, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000013, \old(y)=1000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L131] ieee_float_shape_type gf_u; VAL [\old(x)=1000000000000000000000000000013, \old(y)=1000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={7:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L132] gf_u.value = (y) VAL [\old(x)=1000000000000000000000000000013, \old(y)=1000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={7:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L133] EXPR gf_u.word VAL [\old(x)=1000000000000000000000000000013, \old(y)=1000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={7:0}, gf_u.word=6442450943, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000013, \old(y)=1000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000013, \old(y)=1000000000000000000000000000012, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L226] RET, EXPR __ieee754_atan2f(y, x) [L226] float res = __ieee754_atan2f(y, x); [L229] COND TRUE res != pi_o_4 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000011, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, zero_atan2=0] [L230] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000011, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000013, y=1000000000000000000000000000012, 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: 217]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 209 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 2688 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1202 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 340 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1486 mSDtfsCounter, 340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=5, InterpolantAutomatonStates: 19, 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, 6 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:45:24,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...