/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_0683b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:12,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:12,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:12,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:12,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:12,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:12,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:12,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:12,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:12,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:12,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:12,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:12,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:12,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:12,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:12,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:12,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:12,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:13,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:13,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:13,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:13,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:13,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:13,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:13,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:13,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:13,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:13,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:13,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:13,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:13,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:13,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:13,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:13,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:13,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:13,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:13,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:13,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:13,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:13,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:13,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:13,065 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:13,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:13,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:13,144 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:13,144 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:13,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:13,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:13,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:13,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:13,150 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:13,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:13,151 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:13,151 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:13,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:13,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:13,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:13,152 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:13,152 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:13,153 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:13,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:13,153 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:13,153 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:13,154 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:13,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:13,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:13,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:13,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:13,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:13,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:13,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:13,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:13,156 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:13,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:13,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:13,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:13,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:13,813 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:13,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0683b.c [2022-10-15 16:45:13,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd83f0f9/f1e0325335674d82adfb747b17b38081/FLAG11ae8e023 [2022-10-15 16:45:14,684 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:14,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0683b.c [2022-10-15 16:45:14,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd83f0f9/f1e0325335674d82adfb747b17b38081/FLAG11ae8e023 [2022-10-15 16:45:15,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd83f0f9/f1e0325335674d82adfb747b17b38081 [2022-10-15 16:45:15,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:15,046 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:15,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:15,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:15,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:15,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:15" (1/1) ... [2022-10-15 16:45:15,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487a2081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:15, skipping insertion in model container [2022-10-15 16:45:15,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:15" (1/1) ... [2022-10-15 16:45:15,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:15,132 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:15,502 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_0683b.c[5824,5837] [2022-10-15 16:45:15,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:15,519 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:15,625 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_0683b.c[5824,5837] [2022-10-15 16:45:15,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:15,664 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:15,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:15 WrapperNode [2022-10-15 16:45:15,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:15,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:15,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:15,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:15,680 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:15" (1/1) ... [2022-10-15 16:45:15,697 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:15" (1/1) ... [2022-10-15 16:45:15,739 INFO L138 Inliner]: procedures = 21, calls = 89, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 298 [2022-10-15 16:45:15,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:15,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:15,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:15,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:15,754 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:15" (1/1) ... [2022-10-15 16:45:15,754 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:15" (1/1) ... [2022-10-15 16:45:15,761 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:15" (1/1) ... [2022-10-15 16:45:15,761 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:15" (1/1) ... [2022-10-15 16:45:15,797 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:15" (1/1) ... [2022-10-15 16:45:15,816 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:15" (1/1) ... [2022-10-15 16:45:15,826 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:15" (1/1) ... [2022-10-15 16:45:15,832 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:15" (1/1) ... [2022-10-15 16:45:15,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:15,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:15,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:15,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:15,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:15" (1/1) ... [2022-10-15 16:45:15,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:15,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:15,889 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:15,915 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:15,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:15,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:15,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:15,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-10-15 16:45:15,967 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-10-15 16:45:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:15,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:45:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-10-15 16:45:15,968 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-10-15 16:45:15,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:16,106 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:16,109 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:17,024 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:17,047 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:17,047 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-10-15 16:45:17,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:17 BoogieIcfgContainer [2022-10-15 16:45:17,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:17,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:17,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:17,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:17,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:15" (1/3) ... [2022-10-15 16:45:17,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6229b19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:17, skipping insertion in model container [2022-10-15 16:45:17,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:15" (2/3) ... [2022-10-15 16:45:17,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6229b19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:17, skipping insertion in model container [2022-10-15 16:45:17,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:17" (3/3) ... [2022-10-15 16:45:17,075 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0683b.c [2022-10-15 16:45:17,099 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:17,099 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-10-15 16:45:17,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:17,174 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;@2e503d29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:17,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-10-15 16:45:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 155 states have (on average 1.9483870967741936) internal successors, (302), 227 states have internal predecessors, (302), 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:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:17,189 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:17,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:17,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2156997, now seen corresponding path program 1 times [2022-10-15 16:45:17,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:17,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375318385] [2022-10-15 16:45:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:17,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:17,515 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:17,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:17,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375318385] [2022-10-15 16:45:17,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375318385] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:17,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:17,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130304680] [2022-10-15 16:45:17,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:17,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:17,586 INFO L87 Difference]: Start difference. First operand has 234 states, 155 states have (on average 1.9483870967741936) internal successors, (302), 227 states have internal predecessors, (302), 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:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:17,908 INFO L93 Difference]: Finished difference Result 232 states and 283 transitions. [2022-10-15 16:45:17,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:17,912 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:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:17,938 INFO L225 Difference]: With dead ends: 232 [2022-10-15 16:45:17,938 INFO L226 Difference]: Without dead ends: 230 [2022-10-15 16:45:17,941 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:17,948 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 4 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:17,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 469 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:45:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-10-15 16:45:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-10-15 16:45:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 154 states have (on average 1.7727272727272727) internal successors, (273), 223 states have internal predecessors, (273), 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:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 281 transitions. [2022-10-15 16:45:18,021 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 281 transitions. Word has length 4 [2022-10-15 16:45:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:18,022 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 281 transitions. [2022-10-15 16:45:18,023 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:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 281 transitions. [2022-10-15 16:45:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:18,023 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:18,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:18,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:18,024 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:18,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:18,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2156998, now seen corresponding path program 1 times [2022-10-15 16:45:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:18,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576315050] [2022-10-15 16:45:18,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:18,231 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:18,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:18,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576315050] [2022-10-15 16:45:18,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576315050] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:18,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:18,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35212262] [2022-10-15 16:45:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:18,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:18,238 INFO L87 Difference]: Start difference. First operand 230 states and 281 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:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:18,454 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2022-10-15 16:45:18,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:18,455 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:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:18,458 INFO L225 Difference]: With dead ends: 228 [2022-10-15 16:45:18,458 INFO L226 Difference]: Without dead ends: 228 [2022-10-15 16:45:18,459 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:18,461 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 2 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 475 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.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:18,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 475 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:45:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-10-15 16:45:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2022-10-15 16:45:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 154 states have (on average 1.7597402597402598) internal successors, (271), 221 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:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 279 transitions. [2022-10-15 16:45:18,517 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 279 transitions. Word has length 4 [2022-10-15 16:45:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:18,518 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 279 transitions. [2022-10-15 16:45:18,518 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:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 279 transitions. [2022-10-15 16:45:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:18,519 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:18,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:18,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:18,520 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:18,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:18,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1342043793, now seen corresponding path program 1 times [2022-10-15 16:45:18,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:18,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328322622] [2022-10-15 16:45:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:18,678 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:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:18,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328322622] [2022-10-15 16:45:18,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328322622] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:18,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:18,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263687530] [2022-10-15 16:45:18,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:18,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:18,683 INFO L87 Difference]: Start difference. First operand 228 states and 279 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:18,871 INFO L93 Difference]: Finished difference Result 226 states and 277 transitions. [2022-10-15 16:45:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:18,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:45:18,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:18,874 INFO L225 Difference]: With dead ends: 226 [2022-10-15 16:45:18,874 INFO L226 Difference]: Without dead ends: 226 [2022-10-15 16:45:18,874 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:18,876 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 4 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:18,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 459 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:45:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-10-15 16:45:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-10-15 16:45:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 154 states have (on average 1.7467532467532467) internal successors, (269), 219 states have internal predecessors, (269), 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:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2022-10-15 16:45:18,899 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 12 [2022-10-15 16:45:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:18,900 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2022-10-15 16:45:18,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2022-10-15 16:45:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:18,901 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:18,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:18,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:18,902 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1342043794, now seen corresponding path program 1 times [2022-10-15 16:45:18,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:18,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136830311] [2022-10-15 16:45:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:19,146 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:19,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:19,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136830311] [2022-10-15 16:45:19,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136830311] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:19,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:19,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:19,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369270200] [2022-10-15 16:45:19,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:19,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:19,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:19,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:19,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:19,150 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:19,291 INFO L93 Difference]: Finished difference Result 224 states and 275 transitions. [2022-10-15 16:45:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:19,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:45:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:19,294 INFO L225 Difference]: With dead ends: 224 [2022-10-15 16:45:19,294 INFO L226 Difference]: Without dead ends: 224 [2022-10-15 16:45:19,295 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:19,296 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:19,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 469 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-10-15 16:45:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-10-15 16:45:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 154 states have (on average 1.7337662337662338) internal successors, (267), 217 states have internal predecessors, (267), 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:19,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2022-10-15 16:45:19,318 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 12 [2022-10-15 16:45:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:19,319 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2022-10-15 16:45:19,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2022-10-15 16:45:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:19,320 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:19,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:19,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:19,321 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1342377377, now seen corresponding path program 1 times [2022-10-15 16:45:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:19,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990494672] [2022-10-15 16:45:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:19,521 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:19,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:19,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990494672] [2022-10-15 16:45:19,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990494672] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:19,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:19,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086972217] [2022-10-15 16:45:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:19,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:45:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:45:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:19,531 INFO L87 Difference]: Start difference. First operand 224 states and 275 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:19,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:19,702 INFO L93 Difference]: Finished difference Result 226 states and 276 transitions. [2022-10-15 16:45:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:45:19,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:45:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:19,705 INFO L225 Difference]: With dead ends: 226 [2022-10-15 16:45:19,705 INFO L226 Difference]: Without dead ends: 224 [2022-10-15 16:45:19,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:19,707 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 1 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:19,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:45:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-10-15 16:45:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-10-15 16:45:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 154 states have (on average 1.7272727272727273) internal successors, (266), 217 states have internal predecessors, (266), 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:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 274 transitions. [2022-10-15 16:45:19,726 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 274 transitions. Word has length 12 [2022-10-15 16:45:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:19,726 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 274 transitions. [2022-10-15 16:45:19,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 274 transitions. [2022-10-15 16:45:19,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:45:19,728 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:19,728 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:19,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:19,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash 555486396, now seen corresponding path program 1 times [2022-10-15 16:45:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:19,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970753385] [2022-10-15 16:45:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:19,949 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:19,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:19,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970753385] [2022-10-15 16:45:19,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970753385] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:19,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:19,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:19,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970050829] [2022-10-15 16:45:19,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:19,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:19,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:19,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:19,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:19,954 INFO L87 Difference]: Start difference. First operand 224 states and 274 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:20,092 INFO L93 Difference]: Finished difference Result 222 states and 272 transitions. [2022-10-15 16:45:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:20,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:20,097 INFO L225 Difference]: With dead ends: 222 [2022-10-15 16:45:20,098 INFO L226 Difference]: Without dead ends: 222 [2022-10-15 16:45:20,099 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:20,107 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 4 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:20,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 451 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-10-15 16:45:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-10-15 16:45:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 154 states have (on average 1.7142857142857142) internal successors, (264), 215 states have internal predecessors, (264), 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:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 272 transitions. [2022-10-15 16:45:20,152 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 272 transitions. Word has length 18 [2022-10-15 16:45:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:20,152 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 272 transitions. [2022-10-15 16:45:20,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 272 transitions. [2022-10-15 16:45:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:45:20,154 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:20,154 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:20,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:45:20,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:20,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:20,157 INFO L85 PathProgramCache]: Analyzing trace with hash 555486397, now seen corresponding path program 1 times [2022-10-15 16:45:20,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:20,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712984947] [2022-10-15 16:45:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:20,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:20,418 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:20,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:20,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712984947] [2022-10-15 16:45:20,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712984947] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:20,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:20,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:20,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144486558] [2022-10-15 16:45:20,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:20,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:20,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:20,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:20,425 INFO L87 Difference]: Start difference. First operand 222 states and 272 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:20,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:20,533 INFO L93 Difference]: Finished difference Result 220 states and 270 transitions. [2022-10-15 16:45:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:20,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:20,538 INFO L225 Difference]: With dead ends: 220 [2022-10-15 16:45:20,538 INFO L226 Difference]: Without dead ends: 220 [2022-10-15 16:45:20,539 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:20,543 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 2 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:20,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 461 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-10-15 16:45:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-10-15 16:45:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 154 states have (on average 1.7012987012987013) internal successors, (262), 213 states have internal predecessors, (262), 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:20,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 270 transitions. [2022-10-15 16:45:20,556 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 270 transitions. Word has length 18 [2022-10-15 16:45:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:20,561 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 270 transitions. [2022-10-15 16:45:20,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 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:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 270 transitions. [2022-10-15 16:45:20,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-15 16:45:20,564 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:20,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:20,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:45:20,565 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:20,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:20,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1512571659, now seen corresponding path program 1 times [2022-10-15 16:45:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:20,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286155553] [2022-10-15 16:45:20,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:20,750 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:20,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:20,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286155553] [2022-10-15 16:45:20,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286155553] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:20,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:20,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:45:20,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366881507] [2022-10-15 16:45:20,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:20,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:45:20,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:20,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:45:20,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:20,754 INFO L87 Difference]: Start difference. First operand 220 states and 270 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:20,814 INFO L93 Difference]: Finished difference Result 295 states and 366 transitions. [2022-10-15 16:45:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:45:20,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-10-15 16:45:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:20,817 INFO L225 Difference]: With dead ends: 295 [2022-10-15 16:45:20,817 INFO L226 Difference]: Without dead ends: 295 [2022-10-15 16:45:20,818 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:20,819 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 89 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:20,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 798 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-10-15 16:45:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 250. [2022-10-15 16:45:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 184 states have (on average 1.684782608695652) internal successors, (310), 243 states have internal predecessors, (310), 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:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 318 transitions. [2022-10-15 16:45:20,844 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 318 transitions. Word has length 27 [2022-10-15 16:45:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:20,855 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 318 transitions. [2022-10-15 16:45:20,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 318 transitions. [2022-10-15 16:45:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 16:45:20,857 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:20,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:20,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:45:20,858 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting atan_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash 222326477, now seen corresponding path program 1 times [2022-10-15 16:45:20,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:20,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133610224] [2022-10-15 16:45:20,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:20,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:20,961 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:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:20,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133610224] [2022-10-15 16:45:20,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133610224] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:20,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:20,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411958449] [2022-10-15 16:45:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:20,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:20,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:20,966 INFO L87 Difference]: Start difference. First operand 250 states and 318 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:21,014 INFO L93 Difference]: Finished difference Result 269 states and 332 transitions. [2022-10-15 16:45:21,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:21,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 28 [2022-10-15 16:45:21,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:21,018 INFO L225 Difference]: With dead ends: 269 [2022-10-15 16:45:21,018 INFO L226 Difference]: Without dead ends: 269 [2022-10-15 16:45:21,019 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:21,023 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 47 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 516 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:21,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 516 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:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-10-15 16:45:21,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 248. [2022-10-15 16:45:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 182 states have (on average 1.6593406593406594) internal successors, (302), 241 states have internal predecessors, (302), 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,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 310 transitions. [2022-10-15 16:45:21,038 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 310 transitions. Word has length 28 [2022-10-15 16:45:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:21,042 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 310 transitions. [2022-10-15 16:45:21,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 310 transitions. [2022-10-15 16:45:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:45:21,053 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:21,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:21,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:45:21,056 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1506975275, now seen corresponding path program 1 times [2022-10-15 16:45:21,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:21,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018940873] [2022-10-15 16:45:21,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:21,226 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,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:21,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018940873] [2022-10-15 16:45:21,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018940873] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:21,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:21,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158076650] [2022-10-15 16:45:21,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:21,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:21,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:21,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:21,231 INFO L87 Difference]: Start difference. First operand 248 states and 310 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:21,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:21,340 INFO L93 Difference]: Finished difference Result 246 states and 308 transitions. [2022-10-15 16:45:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:21,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-15 16:45:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:21,344 INFO L225 Difference]: With dead ends: 246 [2022-10-15 16:45:21,344 INFO L226 Difference]: Without dead ends: 246 [2022-10-15 16:45:21,345 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:21,346 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 4 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:21,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-10-15 16:45:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-10-15 16:45:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 182 states have (on average 1.6483516483516483) internal successors, (300), 239 states have internal predecessors, (300), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 16:45:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 308 transitions. [2022-10-15 16:45:21,360 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 308 transitions. Word has length 30 [2022-10-15 16:45:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:21,362 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 308 transitions. [2022-10-15 16:45:21,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 308 transitions. [2022-10-15 16:45:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:45:21,366 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:21,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:21,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:45:21,367 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:21,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:21,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1506975274, now seen corresponding path program 1 times [2022-10-15 16:45:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:21,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894829815] [2022-10-15 16:45:21,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:21,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:21,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:21,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:21,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894829815] [2022-10-15 16:45:21,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894829815] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:21,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:21,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:21,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418098224] [2022-10-15 16:45:21,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:21,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:21,601 INFO L87 Difference]: Start difference. First operand 246 states and 308 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:21,707 INFO L93 Difference]: Finished difference Result 244 states and 306 transitions. [2022-10-15 16:45:21,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:21,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-15 16:45:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:21,712 INFO L225 Difference]: With dead ends: 244 [2022-10-15 16:45:21,712 INFO L226 Difference]: Without dead ends: 244 [2022-10-15 16:45:21,713 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:21,715 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 2 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:21,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 455 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-10-15 16:45:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-10-15 16:45:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 182 states have (on average 1.6373626373626373) internal successors, (298), 237 states have internal predecessors, (298), 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,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 306 transitions. [2022-10-15 16:45:21,732 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 306 transitions. Word has length 30 [2022-10-15 16:45:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:21,733 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 306 transitions. [2022-10-15 16:45:21,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:21,733 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 306 transitions. [2022-10-15 16:45:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:45:21,735 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:21,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:21,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:45:21,736 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-10-15 16:45:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:21,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1506951444, now seen corresponding path program 1 times [2022-10-15 16:45:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:21,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481415891] [2022-10-15 16:45:21,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:21,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:21,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:45:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:21,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:45:21,909 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:45:21,911 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (71 of 72 remaining) [2022-10-15 16:45:21,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 72 remaining) [2022-10-15 16:45:21,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 72 remaining) [2022-10-15 16:45:21,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 72 remaining) [2022-10-15 16:45:21,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 72 remaining) [2022-10-15 16:45:21,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 72 remaining) [2022-10-15 16:45:21,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 72 remaining) [2022-10-15 16:45:21,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 72 remaining) [2022-10-15 16:45:21,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fabs_floatErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 72 remaining) [2022-10-15 16:45:21,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 72 remaining) [2022-10-15 16:45:21,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 72 remaining) [2022-10-15 16:45:21,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 72 remaining) [2022-10-15 16:45:21,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 72 remaining) [2022-10-15 16:45:21,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 72 remaining) [2022-10-15 16:45:21,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 72 remaining) [2022-10-15 16:45:21,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 72 remaining) [2022-10-15 16:45:21,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 72 remaining) [2022-10-15 16:45:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 72 remaining) [2022-10-15 16:45:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 72 remaining) [2022-10-15 16:45:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 72 remaining) [2022-10-15 16:45:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 72 remaining) [2022-10-15 16:45:21,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 72 remaining) [2022-10-15 16:45:21,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 72 remaining) [2022-10-15 16:45:21,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 72 remaining) [2022-10-15 16:45:21,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 72 remaining) [2022-10-15 16:45:21,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 72 remaining) [2022-10-15 16:45:21,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 72 remaining) [2022-10-15 16:45:21,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 72 remaining) [2022-10-15 16:45:21,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 72 remaining) [2022-10-15 16:45:21,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 72 remaining) [2022-10-15 16:45:21,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 72 remaining) [2022-10-15 16:45:21,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 72 remaining) [2022-10-15 16:45:21,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 72 remaining) [2022-10-15 16:45:21,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (38 of 72 remaining) [2022-10-15 16:45:21,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 72 remaining) [2022-10-15 16:45:21,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 72 remaining) [2022-10-15 16:45:21,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 72 remaining) [2022-10-15 16:45:21,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 72 remaining) [2022-10-15 16:45:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 72 remaining) [2022-10-15 16:45:21,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 72 remaining) [2022-10-15 16:45:21,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 72 remaining) [2022-10-15 16:45:21,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 72 remaining) [2022-10-15 16:45:21,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 72 remaining) [2022-10-15 16:45:21,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 72 remaining) [2022-10-15 16:45:21,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 72 remaining) [2022-10-15 16:45:21,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 72 remaining) [2022-10-15 16:45:21,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 72 remaining) [2022-10-15 16:45:21,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 72 remaining) [2022-10-15 16:45:21,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 72 remaining) [2022-10-15 16:45:21,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 72 remaining) [2022-10-15 16:45:21,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 72 remaining) [2022-10-15 16:45:21,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 72 remaining) [2022-10-15 16:45:21,927 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 72 remaining) [2022-10-15 16:45:21,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 72 remaining) [2022-10-15 16:45:21,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 72 remaining) [2022-10-15 16:45:21,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 72 remaining) [2022-10-15 16:45:21,928 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 72 remaining) [2022-10-15 16:45:21,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 72 remaining) [2022-10-15 16:45:21,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 72 remaining) [2022-10-15 16:45:21,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 72 remaining) [2022-10-15 16:45:21,929 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 72 remaining) [2022-10-15 16:45:21,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 72 remaining) [2022-10-15 16:45:21,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 72 remaining) [2022-10-15 16:45:21,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 72 remaining) [2022-10-15 16:45:21,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 72 remaining) [2022-10-15 16:45:21,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 72 remaining) [2022-10-15 16:45:21,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 72 remaining) [2022-10-15 16:45:21,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 72 remaining) [2022-10-15 16:45:21,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 72 remaining) [2022-10-15 16:45:21,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 72 remaining) [2022-10-15 16:45:21,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 72 remaining) [2022-10-15 16:45:21,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location atan_floatErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 72 remaining) [2022-10-15 16:45:21,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:45:21,942 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:21,948 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:45:22,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:45:22 BoogieIcfgContainer [2022-10-15 16:45:22,066 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:45:22,067 INFO L158 Benchmark]: Toolchain (without parser) took 7035.30ms. Allocated memory was 158.3MB in the beginning and 199.2MB in the end (delta: 40.9MB). Free memory was 132.2MB in the beginning and 94.9MB in the end (delta: 37.3MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. [2022-10-15 16:45:22,067 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 158.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:22,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.93ms. Allocated memory is still 158.3MB. Free memory was 132.0MB in the beginning and 117.7MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:45:22,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.74ms. Allocated memory is still 158.3MB. Free memory was 117.7MB in the beginning and 114.9MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:22,068 INFO L158 Benchmark]: Boogie Preprocessor took 101.21ms. Allocated memory is still 158.3MB. Free memory was 114.9MB in the beginning and 112.1MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:22,070 INFO L158 Benchmark]: RCFGBuilder took 1214.55ms. Allocated memory is still 158.3MB. Free memory was 111.9MB in the beginning and 105.4MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-10-15 16:45:22,070 INFO L158 Benchmark]: TraceAbstraction took 5000.24ms. Allocated memory was 158.3MB in the beginning and 199.2MB in the end (delta: 40.9MB). Free memory was 104.9MB in the beginning and 94.9MB in the end (delta: 10.0MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. [2022-10-15 16:45:22,072 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 158.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 616.93ms. Allocated memory is still 158.3MB. Free memory was 132.0MB in the beginning and 117.7MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.74ms. Allocated memory is still 158.3MB. Free memory was 117.7MB in the beginning and 114.9MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 101.21ms. Allocated memory is still 158.3MB. Free memory was 114.9MB in the beginning and 112.1MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1214.55ms. Allocated memory is still 158.3MB. Free memory was 111.9MB in the beginning and 105.4MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5000.24ms. Allocated memory was 158.3MB in the beginning and 199.2MB in the end (delta: 40.9MB). Free memory was 104.9MB in the beginning and 94.9MB in the end (delta: 10.0MB). Peak memory consumption was 51.4MB. 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: 257]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 256, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of bitwiseAnd at line 237, overapproximation of memtrack at line 257, 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] [L248] float x = 1.0f / 0.0f; [L249] float y = __VERIFIER_nondet_float(); [L251] CALL, EXPR isfinite_float(y) [L231] __int32_t ix; VAL [\old(x)=1000000000000000000000000000001, 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=1000000000000000000000000000001, zero_atan2=0] [L233] ieee_float_shape_type gf_u; VAL [\old(x)=1000000000000000000000000000001, 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=1000000000000000000000000000001, zero_atan2=0] [L234] gf_u.value = (x) VAL [\old(x)=1000000000000000000000000000001, 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=1000000000000000000000000000001, zero_atan2=0] [L235] EXPR gf_u.word VAL [\old(x)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={9:0}, gf_u.word=8589934590, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000001, zero_atan2=0] [L235] (ix) = gf_u.word [L237] ix &= 0x7fffffff [L238] return (((ix) < 0x7f800000L)); VAL [\old(x)=1000000000000000000000000000001, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix=2139095039, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000001, zero_atan2=0] [L251] RET, EXPR isfinite_float(y) [L251] COND TRUE isfinite_float(y) && y > 0.0f [L253] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, 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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L125] ieee_float_shape_type gf_u; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={10: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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L126] gf_u.value = (x) VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={10: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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L127] EXPR gf_u.word VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={10: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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, 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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L131] ieee_float_shape_type gf_u; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, 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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L132] gf_u.value = (y) VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, 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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L133] EXPR gf_u.word VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, gf_u={7:0}, gf_u.word=4294967295, 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=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=-1, ix=0, iy=2139095041, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=-1, ix=0, iy=2139095041, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L253] RET, EXPR __ieee754_atan2f(y, x) [L253] float res = __ieee754_atan2f(y, x); [L256] EXPR res == 0.0f && __signbit_float(res) == 0 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, res=1000000000000000000000000000003, res == 0.0f && __signbit_float(res) == 0=0, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L256] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L257] reach_error() 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, res=1000000000000000000000000000003, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 241]: 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, 234 locations, 72 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 5639 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2657 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 895 IncrementalHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 2982 mSDtfsCounter, 895 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=8, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 66 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:45:22,121 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...