/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/double_req_bl_0480.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:43:13,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:43:13,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:43:13,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:43:13,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:43:13,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:43:13,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:43:13,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:43:13,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:43:13,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:43:13,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:43:13,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:43:13,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:43:13,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:43:13,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:43:13,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:43:13,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:43:13,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:43:13,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:43:13,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:43:13,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:43:13,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:43:13,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:43:13,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:43:13,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:43:13,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:43:13,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:43:13,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:43:13,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:43:13,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:43:13,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:43:13,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:43:13,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:43:13,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:43:13,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:43:13,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:43:13,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:43:13,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:43:13,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:43:13,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:43:13,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:43:13,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:43:13,639 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:43:13,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:43:13,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:43:13,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:43:13,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:43:13,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:43:13,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:43:13,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:43:13,642 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:43:13,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:43:13,643 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:43:13,643 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:43:13,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:43:13,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:43:13,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:43:13,644 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:43:13,644 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:43:13,644 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:43:13,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:43:13,645 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:43:13,645 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:43:13,645 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:43:13,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:43:13,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:43:13,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:43:13,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:43:13,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:43:13,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:43:13,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:43:13,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:43:13,647 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:43:14,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:43:14,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:43:14,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:43:14,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:43:14,033 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:43:14,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0480.c [2022-10-15 16:43:14,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e36c3f0a/4a5821c76835422385cfa5b9ea41e8ae/FLAGd3d42ad98 [2022-10-15 16:43:14,842 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:43:14,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0480.c [2022-10-15 16:43:14,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e36c3f0a/4a5821c76835422385cfa5b9ea41e8ae/FLAGd3d42ad98 [2022-10-15 16:43:15,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e36c3f0a/4a5821c76835422385cfa5b9ea41e8ae [2022-10-15 16:43:15,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:43:15,156 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:43:15,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:43:15,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:43:15,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:43:15,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c834cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15, skipping insertion in model container [2022-10-15 16:43:15,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:43:15,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:43:15,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0480.c[5882,5895] [2022-10-15 16:43:15,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:43:15,492 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:43:15,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0480.c[5882,5895] [2022-10-15 16:43:15,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:43:15,568 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:43:15,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15 WrapperNode [2022-10-15 16:43:15,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:43:15,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:43:15,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:43:15,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:43:15,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,640 INFO L138 Inliner]: procedures = 17, calls = 38, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 161 [2022-10-15 16:43:15,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:43:15,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:43:15,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:43:15,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:43:15,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,724 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:43:15,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:43:15,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:43:15,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:43:15,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (1/1) ... [2022-10-15 16:43:15,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:43:15,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:43:15,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:43:15,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:43:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:43:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:43:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:43:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:43:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:43:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2022-10-15 16:43:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2022-10-15 16:43:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:43:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:43:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:43:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:43:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:43:15,985 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:43:15,988 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:43:16,951 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:43:16,960 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:43:16,961 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-10-15 16:43:16,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:43:16 BoogieIcfgContainer [2022-10-15 16:43:16,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:43:16,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:43:16,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:43:16,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:43:16,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:43:15" (1/3) ... [2022-10-15 16:43:16,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8a374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:43:16, skipping insertion in model container [2022-10-15 16:43:16,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:43:15" (2/3) ... [2022-10-15 16:43:16,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8a374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:43:16, skipping insertion in model container [2022-10-15 16:43:16,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:43:16" (3/3) ... [2022-10-15 16:43:16,974 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0480.c [2022-10-15 16:43:16,997 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:43:16,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-10-15 16:43:17,061 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:43:17,071 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;@7afbf265, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:43:17,071 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-10-15 16:43:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 98 states have (on average 1.8571428571428572) internal successors, (182), 130 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:43:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:43:17,090 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:17,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:43:17,091 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [__ieee754_sqrtErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:43:17,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash 7698117, now seen corresponding path program 1 times [2022-10-15 16:43:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:17,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367572178] [2022-10-15 16:43:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:17,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:17,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367572178] [2022-10-15 16:43:17,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367572178] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:17,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:17,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:17,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254648956] [2022-10-15 16:43:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:17,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:17,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:17,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:17,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:17,439 INFO L87 Difference]: Start difference. First operand has 134 states, 98 states have (on average 1.8571428571428572) internal successors, (182), 130 states have internal predecessors, (182), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:17,594 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2022-10-15 16:43:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:17,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:43:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:17,617 INFO L225 Difference]: With dead ends: 132 [2022-10-15 16:43:17,617 INFO L226 Difference]: Without dead ends: 130 [2022-10-15 16:43:17,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:17,625 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:17,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 273 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-10-15 16:43:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-10-15 16:43:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 97 states have (on average 1.6082474226804124) internal successors, (156), 126 states have internal predecessors, (156), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:43:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 160 transitions. [2022-10-15 16:43:17,724 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 160 transitions. Word has length 4 [2022-10-15 16:43:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:17,725 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 160 transitions. [2022-10-15 16:43:17,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 160 transitions. [2022-10-15 16:43:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:43:17,726 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:17,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:43:17,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:43:17,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [__ieee754_sqrtErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:43:17,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:17,728 INFO L85 PathProgramCache]: Analyzing trace with hash 7698118, now seen corresponding path program 1 times [2022-10-15 16:43:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:17,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588322741] [2022-10-15 16:43:17,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:17,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:17,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:17,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588322741] [2022-10-15 16:43:17,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588322741] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:17,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:17,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961135224] [2022-10-15 16:43:17,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:17,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:17,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:17,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:17,905 INFO L87 Difference]: Start difference. First operand 130 states and 160 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:17,992 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2022-10-15 16:43:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:17,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:43:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:17,995 INFO L225 Difference]: With dead ends: 128 [2022-10-15 16:43:17,995 INFO L226 Difference]: Without dead ends: 128 [2022-10-15 16:43:17,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:17,998 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 2 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:17,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 276 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-10-15 16:43:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-10-15 16:43:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 97 states have (on average 1.5876288659793814) internal successors, (154), 124 states have internal predecessors, (154), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:43:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2022-10-15 16:43:18,012 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 4 [2022-10-15 16:43:18,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:18,012 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2022-10-15 16:43:18,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-10-15 16:43:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 16:43:18,014 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:18,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:18,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:43:18,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [__ieee754_sqrtErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:43:18,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:18,016 INFO L85 PathProgramCache]: Analyzing trace with hash -151962818, now seen corresponding path program 1 times [2022-10-15 16:43:18,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:18,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103822667] [2022-10-15 16:43:18,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:18,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:18,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:18,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103822667] [2022-10-15 16:43:18,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103822667] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:18,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:18,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:43:18,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581295332] [2022-10-15 16:43:18,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:18,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:18,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:18,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:18,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:18,174 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:18,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:18,218 INFO L93 Difference]: Finished difference Result 149 states and 179 transitions. [2022-10-15 16:43:18,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:18,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-10-15 16:43:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:18,247 INFO L225 Difference]: With dead ends: 149 [2022-10-15 16:43:18,247 INFO L226 Difference]: Without dead ends: 149 [2022-10-15 16:43:18,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:18,251 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 21 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:18,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 301 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:43:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-10-15 16:43:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2022-10-15 16:43:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 100 states have (on average 1.57) internal successors, (157), 127 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:43:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 161 transitions. [2022-10-15 16:43:18,268 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 161 transitions. Word has length 11 [2022-10-15 16:43:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:18,268 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 161 transitions. [2022-10-15 16:43:18,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 161 transitions. [2022-10-15 16:43:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:43:18,270 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:18,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:18,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:43:18,270 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [__ieee754_sqrtErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:43:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1133288414, now seen corresponding path program 1 times [2022-10-15 16:43:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:18,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636987914] [2022-10-15 16:43:18,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:18,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:18,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:18,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636987914] [2022-10-15 16:43:18,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636987914] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:18,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:18,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:18,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413849557] [2022-10-15 16:43:18,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:18,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:18,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:18,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:18,470 INFO L87 Difference]: Start difference. First operand 131 states and 161 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:18,540 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2022-10-15 16:43:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:18,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:43:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:18,546 INFO L225 Difference]: With dead ends: 129 [2022-10-15 16:43:18,546 INFO L226 Difference]: Without dead ends: 129 [2022-10-15 16:43:18,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:18,558 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 4 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:18,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 270 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-10-15 16:43:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-10-15 16:43:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.55) internal successors, (155), 125 states have internal predecessors, (155), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:43:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2022-10-15 16:43:18,589 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 14 [2022-10-15 16:43:18,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:18,589 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2022-10-15 16:43:18,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2022-10-15 16:43:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:43:18,591 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:18,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:18,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:43:18,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [__ieee754_sqrtErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:43:18,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:18,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1133288413, now seen corresponding path program 1 times [2022-10-15 16:43:18,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:18,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325829827] [2022-10-15 16:43:18,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:18,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:18,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325829827] [2022-10-15 16:43:18,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325829827] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:18,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:18,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:18,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840348658] [2022-10-15 16:43:18,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:18,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:18,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:18,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:18,741 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:18,799 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2022-10-15 16:43:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:18,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:43:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:18,801 INFO L225 Difference]: With dead ends: 127 [2022-10-15 16:43:18,802 INFO L226 Difference]: Without dead ends: 127 [2022-10-15 16:43:18,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:18,803 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:18,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 264 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-10-15 16:43:18,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-10-15 16:43:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 100 states have (on average 1.53) internal successors, (153), 123 states have internal predecessors, (153), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:43:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2022-10-15 16:43:18,813 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 14 [2022-10-15 16:43:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:18,813 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2022-10-15 16:43:18,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2022-10-15 16:43:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:43:18,815 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:18,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:18,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:43:18,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [__ieee754_sqrtErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:43:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash -157385214, now seen corresponding path program 1 times [2022-10-15 16:43:18,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:18,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897501426] [2022-10-15 16:43:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:18,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:18,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897501426] [2022-10-15 16:43:18,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897501426] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:18,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:18,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:18,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455230001] [2022-10-15 16:43:18,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:18,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:18,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:18,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:18,875 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:18,934 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2022-10-15 16:43:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:18,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:43:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:18,936 INFO L225 Difference]: With dead ends: 125 [2022-10-15 16:43:18,937 INFO L226 Difference]: Without dead ends: 125 [2022-10-15 16:43:18,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:18,938 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:18,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 257 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:43:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-10-15 16:43:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-10-15 16:43:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 100 states have (on average 1.51) internal successors, (151), 121 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:43:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2022-10-15 16:43:18,946 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 15 [2022-10-15 16:43:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:18,946 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2022-10-15 16:43:18,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-10-15 16:43:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:43:18,948 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:18,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:18,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:43:18,948 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [__ieee754_sqrtErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:43:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:18,949 INFO L85 PathProgramCache]: Analyzing trace with hash -157385213, now seen corresponding path program 1 times [2022-10-15 16:43:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:18,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192290603] [2022-10-15 16:43:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:18,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:43:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:43:19,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:43:19,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192290603] [2022-10-15 16:43:19,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192290603] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:43:19,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:43:19,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:43:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548542308] [2022-10-15 16:43:19,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:43:19,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:43:19,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:43:19,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:43:19,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:19,054 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:43:19,107 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2022-10-15 16:43:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:43:19,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:43:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:43:19,109 INFO L225 Difference]: With dead ends: 123 [2022-10-15 16:43:19,109 INFO L226 Difference]: Without dead ends: 123 [2022-10-15 16:43:19,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:43:19,111 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 2 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:43:19,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 264 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:43:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-10-15 16:43:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-10-15 16:43:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 100 states have (on average 1.49) internal successors, (149), 119 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:43:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 153 transitions. [2022-10-15 16:43:19,117 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 153 transitions. Word has length 15 [2022-10-15 16:43:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:43:19,118 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 153 transitions. [2022-10-15 16:43:19,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:43:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions. [2022-10-15 16:43:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:43:19,119 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:43:19,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:19,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:43:19,120 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [__ieee754_sqrtErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, __ieee754_sqrtErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:43:19,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:43:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash -157361383, now seen corresponding path program 1 times [2022-10-15 16:43:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:43:19,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953006806] [2022-10-15 16:43:19,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:43:19,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:43:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:43:19,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:43:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:43:19,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:43:19,178 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:43:19,180 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (31 of 32 remaining) [2022-10-15 16:43:19,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2022-10-15 16:43:19,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2022-10-15 16:43:19,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2022-10-15 16:43:19,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2022-10-15 16:43:19,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2022-10-15 16:43:19,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2022-10-15 16:43:19,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2022-10-15 16:43:19,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2022-10-15 16:43:19,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2022-10-15 16:43:19,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2022-10-15 16:43:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2022-10-15 16:43:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2022-10-15 16:43:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2022-10-15 16:43:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2022-10-15 16:43:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2022-10-15 16:43:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2022-10-15 16:43:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2022-10-15 16:43:19,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2022-10-15 16:43:19,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2022-10-15 16:43:19,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2022-10-15 16:43:19,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2022-10-15 16:43:19,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2022-10-15 16:43:19,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2022-10-15 16:43:19,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2022-10-15 16:43:19,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2022-10-15 16:43:19,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2022-10-15 16:43:19,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2022-10-15 16:43:19,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2022-10-15 16:43:19,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2022-10-15 16:43:19,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2022-10-15 16:43:19,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (0 of 32 remaining) [2022-10-15 16:43:19,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:43:19,195 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:43:19,200 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:43:19,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:43:19 BoogieIcfgContainer [2022-10-15 16:43:19,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:43:19,265 INFO L158 Benchmark]: Toolchain (without parser) took 4115.63ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 125.7MB in the beginning and 159.5MB in the end (delta: -33.8MB). Peak memory consumption was 84.3MB. Max. memory is 8.0GB. [2022-10-15 16:43:19,266 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:43:19,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.14ms. Allocated memory is still 151.0MB. Free memory was 125.5MB in the beginning and 111.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 16:43:19,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.25ms. Allocated memory is still 151.0MB. Free memory was 111.1MB in the beginning and 108.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:43:19,267 INFO L158 Benchmark]: Boogie Preprocessor took 99.40ms. Allocated memory is still 151.0MB. Free memory was 108.9MB in the beginning and 106.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:43:19,267 INFO L158 Benchmark]: RCFGBuilder took 1218.46ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 100.2MB in the end (delta: 6.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:43:19,268 INFO L158 Benchmark]: TraceAbstraction took 2298.20ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 99.2MB in the beginning and 159.5MB in the end (delta: -60.4MB). Peak memory consumption was 59.2MB. Max. memory is 8.0GB. [2022-10-15 16:43:19,272 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.24ms. Allocated memory is still 151.0MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 407.14ms. Allocated memory is still 151.0MB. Free memory was 125.5MB in the beginning and 111.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.25ms. Allocated memory is still 151.0MB. Free memory was 111.1MB in the beginning and 108.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 99.40ms. Allocated memory is still 151.0MB. Free memory was 108.9MB in the beginning and 106.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1218.46ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 100.2MB in the end (delta: 6.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2298.20ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 99.2MB in the beginning and 159.5MB in the end (delta: -60.4MB). Peak memory consumption was 59.2MB. 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: 239]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someUnaryDOUBLEoperation at line 147, overapproximation of someBinaryArithmeticDOUBLEoperation at line 183, overapproximation of memtrack at line 239, overapproximation of someBinaryDOUBLEComparisonOperation at line 238. Possible FailurePath: [L30] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; [L142-L155] static const double one_acos = 1.00000000000000000000e+00, pi = 3.14159265358979311600e+00, pio2_hi_acos = 1.57079632679489655800e+00, pio2_lo_acos = 6.12323399573676603587e-17, pS0_acos = 1.66666666666666657415e-01, pS1_acos = -3.25565818622400915405e-01, pS2_acos = 2.01212532134862925881e-01, pS3_acos = -4.00555345006794114027e-02, pS4_acos = 7.91534994289814532176e-04, pS5_acos = 3.47933107596021167570e-05, qS1_acos = -2.40339491173441421878e+00, qS2_acos = 2.02094576023350569471e+00, qS3_acos = -6.88283971605453293030e-01, qS4_acos = 7.70381505559019352791e-02; VAL [one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L234] double x = 1.0; [L235] CALL, EXPR __ieee754_acos(x) [L158] double z, p, q, r, w, s, c, df; [L159] __int32_t hx, ix; VAL [\old(x)=1, one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L161] ieee_double_shape_type gh_u; VAL [\old(x)=1, gh_u={5:0}, one_acos=1, one_sqrt=1, pi=785398163397448279/500000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L162] gh_u.value = (x) VAL [\old(x)=1, gh_u={5:0}, one_acos=1, one_sqrt=1, pi=785398163397448279/250000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L163] EXPR gh_u.parts.msw VAL [\old(x)=1, gh_u={5:0}, gh_u.parts.msw=0, one_acos=1, one_sqrt=1, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L163] (hx) = gh_u.parts.msw [L165] ix = hx & 0x7fffffff VAL [\old(x)=1, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L166] COND FALSE !(ix >= 0x3ff00000) VAL [\old(x)=1, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L181] COND TRUE ix < 0x3fe00000 VAL [\old(x)=1, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L182] COND TRUE ix <= 0x3c600000 [L183] return pio2_hi_acos + pio2_lo_acos; VAL [\old(x)=1, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L235] RET, EXPR __ieee754_acos(x) [L235] double res = __ieee754_acos(x); [L238] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_acos=1, one_sqrt=1, pi=785398163397448279/250000000000000000, pi=785398163397448279/500000000000000000, pi=612323399573676603587/10000000000000000000000000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, res=57, res == 0.0 && __signbit_double(res) == 0=0, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] [L238] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L239] reach_error() VAL [one_acos=1, one_sqrt=1, pi=612323399573676603587/10000000000000000000000000000000000000, pi=785398163397448279/500000000000000000, pi=785398163397448279/250000000000000000, pS0_acos=33333333333333331483/200000000000000000000, pS2_acos=201212532134862925881/1000000000000000000000, pS4_acos=49470937143113408261/62500000000000000000000, pS5_acos=34793310759602116757/1000000000000000000000000, qS2_acos=202094576023350569471/100000000000000000000, qS4_acos=770381505559019352791/10000000000000000000000, res=57, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 228]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 134 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 1905 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 842 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1063 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 108 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:43:19,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...