/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/float_req_bl_0460.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:44:49,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:44:49,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:44:49,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:44:49,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:44:49,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:44:49,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:44:49,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:44:49,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:44:49,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:44:49,629 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:44:49,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:44:49,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:44:49,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:44:49,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:44:49,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:44:49,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:44:49,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:44:49,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:44:49,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:44:49,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:44:49,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:44:49,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:44:49,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:44:49,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:44:49,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:44:49,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:44:49,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:44:49,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:44:49,681 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:44:49,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:44:49,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:44:49,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:44:49,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:44:49,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:44:49,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:44:49,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:44:49,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:44:49,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:44:49,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:44:49,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:44:49,691 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:44:49,734 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:44:49,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:44:49,735 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:44:49,735 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:44:49,736 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:44:49,736 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:44:49,737 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:44:49,737 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:44:49,737 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:44:49,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:44:49,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:44:49,738 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:44:49,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:44:49,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:44:49,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:44:49,739 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:44:49,739 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:44:49,739 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:44:49,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:44:49,740 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:44:49,740 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:44:49,740 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:44:49,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:44:49,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:44:49,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:44:49,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:49,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:44:49,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:44:49,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:44:49,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:44:49,742 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:44:50,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:44:50,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:44:50,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:44:50,135 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:44:50,136 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:44:50,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0460.c [2022-10-15 16:44:50,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3a1d7d6/903f828f99824deeba97565030077323/FLAG7fbd99d43 [2022-10-15 16:44:50,905 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:44:50,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0460.c [2022-10-15 16:44:50,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3a1d7d6/903f828f99824deeba97565030077323/FLAG7fbd99d43 [2022-10-15 16:44:51,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3a1d7d6/903f828f99824deeba97565030077323 [2022-10-15 16:44:51,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:44:51,215 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:44:51,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:51,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:44:51,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:44:51,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b169883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51, skipping insertion in model container [2022-10-15 16:44:51,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:44:51,271 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:44:51,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0460.c[4448,4461] [2022-10-15 16:44:51,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:51,565 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:44:51,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0460.c[4448,4461] [2022-10-15 16:44:51,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:51,703 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:44:51,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51 WrapperNode [2022-10-15 16:44:51,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:51,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:51,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:44:51,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:44:51,716 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:44:51" (1/1) ... [2022-10-15 16:44:51,750 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:44:51" (1/1) ... [2022-10-15 16:44:51,803 INFO L138 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2022-10-15 16:44:51,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:51,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:44:51,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:44:51,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:44:51,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,859 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:44:51,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:44:51,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:44:51,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:44:51,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51" (1/1) ... [2022-10-15 16:44:51,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:51,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:44:51,912 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:44:51,936 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:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:44:51,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:44:51,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:44:51,985 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-10-15 16:44:51,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-10-15 16:44:52,120 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:44:52,128 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:44:52,706 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:44:52,716 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:44:52,716 INFO L300 CfgBuilder]: Removed 12 assume(true) statements. [2022-10-15 16:44:52,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:52 BoogieIcfgContainer [2022-10-15 16:44:52,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:44:52,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:44:52,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:44:52,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:44:52,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:44:51" (1/3) ... [2022-10-15 16:44:52,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4c6abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:52, skipping insertion in model container [2022-10-15 16:44:52,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:51" (2/3) ... [2022-10-15 16:44:52,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4c6abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:52, skipping insertion in model container [2022-10-15 16:44:52,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:52" (3/3) ... [2022-10-15 16:44:52,731 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0460.c [2022-10-15 16:44:52,763 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:44:52,763 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-10-15 16:44:52,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:44:52,894 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;@37a5c755, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:44:52,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-10-15 16:44:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 76 states have (on average 1.855263157894737) internal successors, (141), 98 states have internal predecessors, (141), 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:44:52,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:44:52,909 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:52,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:44:52,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-15 16:44:52,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:52,918 INFO L85 PathProgramCache]: Analyzing trace with hash 28817889, now seen corresponding path program 1 times [2022-10-15 16:44:52,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:52,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673957148] [2022-10-15 16:44:52,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:52,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:53,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673957148] [2022-10-15 16:44:53,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673957148] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:53,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:53,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:53,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924882461] [2022-10-15 16:44:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:53,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:53,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:53,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:53,381 INFO L87 Difference]: Start difference. First operand has 102 states, 76 states have (on average 1.855263157894737) internal successors, (141), 98 states have internal predecessors, (141), 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.5) internal successors, (5), 3 states have internal predecessors, (5), 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:44:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:53,566 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2022-10-15 16:44:53,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:53,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-10-15 16:44:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:53,597 INFO L225 Difference]: With dead ends: 104 [2022-10-15 16:44:53,598 INFO L226 Difference]: Without dead ends: 100 [2022-10-15 16:44:53,601 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:44:53,611 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:53,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 211 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-15 16:44:53,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-10-15 16:44:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.5733333333333333) internal successors, (118), 96 states have internal predecessors, (118), 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:44:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2022-10-15 16:44:53,670 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 5 [2022-10-15 16:44:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:53,671 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2022-10-15 16:44:53,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:44:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2022-10-15 16:44:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:44:53,672 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:53,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:44:53,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:44:53,673 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-15 16:44:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash 28693828, now seen corresponding path program 1 times [2022-10-15 16:44:53,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:53,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136993858] [2022-10-15 16:44:53,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:53,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:53,824 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:44:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:53,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136993858] [2022-10-15 16:44:53,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136993858] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:53,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:53,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:53,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430805887] [2022-10-15 16:44:53,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:53,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:53,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:53,831 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:44:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:53,977 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2022-10-15 16:44:53,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:53,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-10-15 16:44:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:53,985 INFO L225 Difference]: With dead ends: 98 [2022-10-15 16:44:53,985 INFO L226 Difference]: Without dead ends: 98 [2022-10-15 16:44:53,990 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:44:53,994 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:53,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 201 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-15 16:44:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-10-15 16:44:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 94 states have internal predecessors, (116), 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:44:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2022-10-15 16:44:54,032 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 5 [2022-10-15 16:44:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:54,033 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2022-10-15 16:44:54,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:44:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2022-10-15 16:44:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:44:54,036 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:54,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:44:54,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:44:54,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-15 16:44:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2022-10-15 16:44:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:54,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637569531] [2022-10-15 16:44:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:54,339 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:44:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:54,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637569531] [2022-10-15 16:44:54,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637569531] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:54,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:54,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457076114] [2022-10-15 16:44:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:54,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:54,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:54,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:54,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:54,347 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:44:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:54,438 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-10-15 16:44:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:54,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-10-15 16:44:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:54,441 INFO L225 Difference]: With dead ends: 96 [2022-10-15 16:44:54,441 INFO L226 Difference]: Without dead ends: 96 [2022-10-15 16:44:54,442 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:44:54,443 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:54,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 207 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-15 16:44:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-10-15 16:44:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.52) internal successors, (114), 92 states have internal predecessors, (114), 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:44:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2022-10-15 16:44:54,456 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 5 [2022-10-15 16:44:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:54,456 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2022-10-15 16:44:54,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:44:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-10-15 16:44:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:44:54,458 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:54,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:54,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:44:54,459 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-15 16:44:54,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 383453139, now seen corresponding path program 1 times [2022-10-15 16:44:54,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:54,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769921478] [2022-10-15 16:44:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:54,542 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:44:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:54,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769921478] [2022-10-15 16:44:54,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769921478] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:54,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:54,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:44:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659579899] [2022-10-15 16:44:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:54,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:54,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:54,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:54,547 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:54,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:54,578 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-10-15 16:44:54,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:54,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:44:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:54,581 INFO L225 Difference]: With dead ends: 108 [2022-10-15 16:44:54,581 INFO L226 Difference]: Without dead ends: 108 [2022-10-15 16:44:54,581 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:44:54,583 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 11 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:54,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 220 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-15 16:44:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2022-10-15 16:44:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 96 states have internal predecessors, (118), 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:44:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2022-10-15 16:44:54,596 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 15 [2022-10-15 16:44:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:54,597 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2022-10-15 16:44:54,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2022-10-15 16:44:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:44:54,599 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:54,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:54,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:44:54,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2022-10-15 16:44:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:54,601 INFO L85 PathProgramCache]: Analyzing trace with hash 484440472, now seen corresponding path program 1 times [2022-10-15 16:44:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:54,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502104601] [2022-10-15 16:44:54,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:54,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:54,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:44:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:54,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:44:54,719 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:44:54,721 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (21 of 22 remaining) [2022-10-15 16:44:54,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 22 remaining) [2022-10-15 16:44:54,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 22 remaining) [2022-10-15 16:44:54,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 22 remaining) [2022-10-15 16:44:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 22 remaining) [2022-10-15 16:44:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 22 remaining) [2022-10-15 16:44:54,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 22 remaining) [2022-10-15 16:44:54,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 22 remaining) [2022-10-15 16:44:54,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 22 remaining) [2022-10-15 16:44:54,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 22 remaining) [2022-10-15 16:44:54,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 22 remaining) [2022-10-15 16:44:54,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 22 remaining) [2022-10-15 16:44:54,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 22 remaining) [2022-10-15 16:44:54,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (8 of 22 remaining) [2022-10-15 16:44:54,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 22 remaining) [2022-10-15 16:44:54,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 22 remaining) [2022-10-15 16:44:54,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 22 remaining) [2022-10-15 16:44:54,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 22 remaining) [2022-10-15 16:44:54,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 22 remaining) [2022-10-15 16:44:54,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 22 remaining) [2022-10-15 16:44:54,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 22 remaining) [2022-10-15 16:44:54,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 22 remaining) [2022-10-15 16:44:54,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:44:54,751 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-10-15 16:44:54,758 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:44:54,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:44:54 BoogieIcfgContainer [2022-10-15 16:44:54,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:44:54,849 INFO L158 Benchmark]: Toolchain (without parser) took 3640.04ms. Allocated memory is still 154.1MB. Free memory was 128.9MB in the beginning and 56.6MB in the end (delta: 72.2MB). Peak memory consumption was 72.2MB. Max. memory is 8.0GB. [2022-10-15 16:44:54,850 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 154.1MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:44:54,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.27ms. Allocated memory is still 154.1MB. Free memory was 128.6MB in the beginning and 115.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 16:44:54,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.08ms. Allocated memory is still 154.1MB. Free memory was 115.6MB in the beginning and 113.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:54,856 INFO L158 Benchmark]: Boogie Preprocessor took 64.92ms. Allocated memory is still 154.1MB. Free memory was 113.6MB in the beginning and 111.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:54,856 INFO L158 Benchmark]: RCFGBuilder took 848.74ms. Allocated memory is still 154.1MB. Free memory was 111.3MB in the beginning and 124.3MB in the end (delta: -12.9MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-10-15 16:44:54,857 INFO L158 Benchmark]: TraceAbstraction took 2126.04ms. Allocated memory is still 154.1MB. Free memory was 123.7MB in the beginning and 56.6MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:54,867 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 154.1MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 484.27ms. Allocated memory is still 154.1MB. Free memory was 128.6MB in the beginning and 115.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 99.08ms. Allocated memory is still 154.1MB. Free memory was 115.6MB in the beginning and 113.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.92ms. Allocated memory is still 154.1MB. Free memory was 113.6MB in the beginning and 111.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 848.74ms. Allocated memory is still 154.1MB. Free memory was 111.3MB in the beginning and 124.3MB in the end (delta: -12.9MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2126.04ms. Allocated memory is still 154.1MB. Free memory was 123.7MB in the beginning and 56.6MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 179]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 15, overapproximation of someUnaryDOUBLEoperation at line 89, overapproximation of memtrack at line 179, overapproximation of someBinaryArithmeticFLOAToperation at line 114. Possible FailurePath: [L17] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; [L86-L93] static const float one_acos = 1.0000000000e+00, pi = 3.1415925026e+00, pio2_hi_acos = 1.5707962513e+00, pio2_lo_acos = 7.5497894159e-08, pS0_acos = 1.6666667163e-01, pS1_acos = -3.2556581497e-01, pS2_acos = 2.0121252537e-01, pS3_acos = -4.0055535734e-02, pS4_acos = 7.9153501429e-04, pS5_acos = 3.4793309169e-05, qS1_acos = -2.4033949375e+00, qS2_acos = 2.0209457874e+00, qS3_acos = -6.8828397989e-01, qS4_acos = 7.7038154006e-02; VAL [one_acos=1, one_sqrt=1, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000] [L171] float x = __VERIFIER_nondet_float(); [L173] COND TRUE x < -1.0f || x > 1.0f [L175] CALL, EXPR __ieee754_acosf(x) [L96] float z, p, q, r, w, s, c, df; [L97] __int32_t hx, ix; VAL [\old(x)=4294967305, one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967305] [L99] ieee_float_shape_type gf_u; VAL [\old(x)=4294967305, gf_u={5:0}, one_acos=1, one_sqrt=1, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967305] [L100] gf_u.value = (x) VAL [\old(x)=4294967305, gf_u={5:0}, one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967305] [L101] EXPR gf_u.word VAL [\old(x)=4294967305, gf_u={5:0}, gf_u.word=4294967296, one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967305] [L101] (hx) = gf_u.word [L103] ix = hx & 0x7fffffff VAL [\old(x)=4294967305, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967305] [L104] COND FALSE !(ix == 0x3f800000) VAL [\old(x)=4294967305, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=15707962513/10000000000, pi=75497894159/1000000000000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967305] [L109] COND FALSE !(ix > 0x3f800000) VAL [\old(x)=4294967305, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967305] [L112] COND TRUE ix < 0x3f000000 VAL [\old(x)=4294967305, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=75497894159/1000000000000000000, pi=15707962513/5000000000, pi=15707962513/10000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967305] [L113] COND TRUE ix <= 0x23000000 [L114] return pio2_hi_acos + pio2_lo_acos; VAL [\old(x)=4294967305, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=15707962513/10000000000, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967305] [L175] RET, EXPR __ieee754_acosf(x) [L175] float res = __ieee754_acosf(x); [L178] CALL, EXPR isnan_float(res) [L15] return x != x; VAL [\old(x)=4294967304, \result=0, one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=15707962513/10000000000, pi=75497894159/1000000000000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967304] [L178] RET, EXPR isnan_float(res) [L178] COND TRUE !isnan_float(res) [L179] reach_error() VAL [one_acos=1, one_sqrt=1, pi=15707962513/10000000000, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, res=4294967304, tiny_sqrt=1/1000000000000000000000000000000, x=4294967305] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 164]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 839 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 372 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 467 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 46 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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:44:54,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...