/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_1121a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 01:18:52,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 01:18:52,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 01:18:52,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 01:18:52,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 01:18:52,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 01:18:52,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 01:18:52,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 01:18:52,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 01:18:52,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 01:18:52,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 01:18:52,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 01:18:52,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 01:18:52,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 01:18:52,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 01:18:52,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 01:18:52,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 01:18:52,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 01:18:52,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 01:18:52,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 01:18:52,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 01:18:52,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 01:18:52,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 01:18:52,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 01:18:52,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 01:18:52,637 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 01:18:52,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 01:18:52,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 01:18:52,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 01:18:52,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 01:18:52,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 01:18:52,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 01:18:52,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 01:18:52,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 01:18:52,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 01:18:52,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 01:18:52,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 01:18:52,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 01:18:52,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 01:18:52,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 01:18:52,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 01:18:52,651 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-16 01:18:52,703 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 01:18:52,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 01:18:52,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 01:18:52,704 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 01:18:52,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 01:18:52,706 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 01:18:52,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 01:18:52,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 01:18:52,710 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 01:18:52,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 01:18:52,711 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 01:18:52,711 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 01:18:52,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 01:18:52,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 01:18:52,712 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 01:18:52,712 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 01:18:52,712 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 01:18:52,712 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 01:18:52,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 01:18:52,713 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 01:18:52,713 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 01:18:52,713 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 01:18:52,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 01:18:52,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 01:18:52,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 01:18:52,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:18:52,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 01:18:52,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 01:18:52,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 01:18:52,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 01:18:52,715 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-16 01:18:53,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 01:18:53,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 01:18:53,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 01:18:53,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 01:18:53,108 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 01:18:53,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1121a.c [2022-10-16 01:18:53,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91b446be/e68c75d29c4842b997ae21731aaf33c2/FLAGf41054dc0 [2022-10-16 01:18:53,819 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 01:18:53,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1121a.c [2022-10-16 01:18:53,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91b446be/e68c75d29c4842b997ae21731aaf33c2/FLAGf41054dc0 [2022-10-16 01:18:54,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91b446be/e68c75d29c4842b997ae21731aaf33c2 [2022-10-16 01:18:54,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 01:18:54,180 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 01:18:54,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 01:18:54,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 01:18:54,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 01:18:54,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302246f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54, skipping insertion in model container [2022-10-16 01:18:54,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 01:18:54,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 01:18:54,446 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_1121a.c[3883,3896] [2022-10-16 01:18:54,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:18:54,458 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 01:18:54,510 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_1121a.c[3883,3896] [2022-10-16 01:18:54,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:18:54,533 INFO L208 MainTranslator]: Completed translation [2022-10-16 01:18:54,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54 WrapperNode [2022-10-16 01:18:54,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 01:18:54,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 01:18:54,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 01:18:54,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 01:18:54,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,561 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,672 INFO L138 Inliner]: procedures = 18, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 306 [2022-10-16 01:18:54,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 01:18:54,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 01:18:54,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 01:18:54,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 01:18:54,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,730 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 01:18:54,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 01:18:54,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 01:18:54,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 01:18:54,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (1/1) ... [2022-10-16 01:18:54,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:18:54,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:18:54,783 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-16 01:18:54,807 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-16 01:18:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 01:18:54,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 01:18:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 01:18:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 01:18:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 01:18:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-16 01:18:54,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 01:18:54,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 01:18:54,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 01:18:54,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-16 01:18:54,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 01:18:55,004 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 01:18:55,006 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 01:18:55,916 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 01:18:55,927 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 01:18:55,927 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-10-16 01:18:55,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:18:55 BoogieIcfgContainer [2022-10-16 01:18:55,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 01:18:55,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 01:18:55,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 01:18:55,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 01:18:55,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:18:54" (1/3) ... [2022-10-16 01:18:55,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af4cf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:18:55, skipping insertion in model container [2022-10-16 01:18:55,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:18:54" (2/3) ... [2022-10-16 01:18:55,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af4cf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:18:55, skipping insertion in model container [2022-10-16 01:18:55,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:18:55" (3/3) ... [2022-10-16 01:18:55,959 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1121a.c [2022-10-16 01:18:55,997 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 01:18:55,998 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-10-16 01:18:56,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 01:18:56,138 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;@744414fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 01:18:56,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-10-16 01:18:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 109 states have (on average 1.9357798165137614) internal successors, (211), 141 states have internal predecessors, (211), 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-16 01:18:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 01:18:56,161 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:56,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 01:18:56,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-16 01:18:56,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-16 01:18:56,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:56,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217746166] [2022-10-16 01:18:56,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:56,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-16 01:18:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:56,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217746166] [2022-10-16 01:18:56,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217746166] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:56,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:56,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39554764] [2022-10-16 01:18:56,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:56,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:56,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:56,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:56,607 INFO L87 Difference]: Start difference. First operand has 142 states, 109 states have (on average 1.9357798165137614) internal successors, (211), 141 states have internal predecessors, (211), 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) 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-16 01:18:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:56,798 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2022-10-16 01:18:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:56,805 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-16 01:18:56,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:56,823 INFO L225 Difference]: With dead ends: 139 [2022-10-16 01:18:56,823 INFO L226 Difference]: Without dead ends: 137 [2022-10-16 01:18:56,826 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-16 01:18:56,831 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 7 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:56,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 320 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-10-16 01:18:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-10-16 01:18:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 136 states have internal predecessors, (183), 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-16 01:18:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2022-10-16 01:18:56,903 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 4 [2022-10-16 01:18:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:56,903 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2022-10-16 01:18:56,904 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-16 01:18:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2022-10-16 01:18:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 01:18:56,904 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:56,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 01:18:56,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 01:18:56,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-16 01:18:56,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:56,906 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-16 01:18:56,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:56,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032770297] [2022-10-16 01:18:56,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:56,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:57,005 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-16 01:18:57,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:57,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032770297] [2022-10-16 01:18:57,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032770297] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:57,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:57,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:57,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659783791] [2022-10-16 01:18:57,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:57,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:57,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:57,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:57,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:57,016 INFO L87 Difference]: Start difference. First operand 137 states and 183 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-16 01:18:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:57,117 INFO L93 Difference]: Finished difference Result 134 states and 180 transitions. [2022-10-16 01:18:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:57,118 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-16 01:18:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:57,120 INFO L225 Difference]: With dead ends: 134 [2022-10-16 01:18:57,120 INFO L226 Difference]: Without dead ends: 134 [2022-10-16 01:18:57,120 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-16 01:18:57,122 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 4 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:57,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 321 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-10-16 01:18:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-10-16 01:18:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 108 states have (on average 1.6666666666666667) internal successors, (180), 133 states have internal predecessors, (180), 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-16 01:18:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 180 transitions. [2022-10-16 01:18:57,134 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 180 transitions. Word has length 4 [2022-10-16 01:18:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:57,135 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 180 transitions. [2022-10-16 01:18:57,135 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-16 01:18:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2022-10-16 01:18:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 01:18:57,136 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:57,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:57,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 01:18:57,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-16 01:18:57,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1761739277, now seen corresponding path program 1 times [2022-10-16 01:18:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:57,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215574393] [2022-10-16 01:18:57,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:57,276 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-16 01:18:57,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:57,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215574393] [2022-10-16 01:18:57,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215574393] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:57,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:57,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476411712] [2022-10-16 01:18:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:57,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:57,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:57,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:57,280 INFO L87 Difference]: Start difference. First operand 134 states and 180 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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-16 01:18:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:57,337 INFO L93 Difference]: Finished difference Result 131 states and 177 transitions. [2022-10-16 01:18:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:57,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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-16 01:18:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:57,339 INFO L225 Difference]: With dead ends: 131 [2022-10-16 01:18:57,339 INFO L226 Difference]: Without dead ends: 131 [2022-10-16 01:18:57,339 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-16 01:18:57,341 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 7 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:57,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 308 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:18:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-10-16 01:18:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-10-16 01:18:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.6388888888888888) internal successors, (177), 130 states have internal predecessors, (177), 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-16 01:18:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2022-10-16 01:18:57,359 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 11 [2022-10-16 01:18:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:57,360 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2022-10-16 01:18:57,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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-16 01:18:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2022-10-16 01:18:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 01:18:57,361 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:57,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:57,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 01:18:57,362 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-16 01:18:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1761739278, now seen corresponding path program 1 times [2022-10-16 01:18:57,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:57,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320525339] [2022-10-16 01:18:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:18:57,574 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-16 01:18:57,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:18:57,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320525339] [2022-10-16 01:18:57,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320525339] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:18:57,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:18:57,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:18:57,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500650167] [2022-10-16 01:18:57,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:18:57,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:18:57,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:18:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:18:57,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:18:57,579 INFO L87 Difference]: Start difference. First operand 131 states and 177 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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-16 01:18:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:18:57,643 INFO L93 Difference]: Finished difference Result 128 states and 174 transitions. [2022-10-16 01:18:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:18:57,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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-16 01:18:57,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:18:57,647 INFO L225 Difference]: With dead ends: 128 [2022-10-16 01:18:57,647 INFO L226 Difference]: Without dead ends: 128 [2022-10-16 01:18:57,648 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-16 01:18:57,660 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 4 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:18:57,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 312 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:18:57,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-10-16 01:18:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-10-16 01:18:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.6111111111111112) internal successors, (174), 127 states have internal predecessors, (174), 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-16 01:18:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2022-10-16 01:18:57,681 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 11 [2022-10-16 01:18:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:18:57,681 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2022-10-16 01:18:57,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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-16 01:18:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2022-10-16 01:18:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 01:18:57,688 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:18:57,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:18:57,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 01:18:57,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-16 01:18:57,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:18:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1363072385, now seen corresponding path program 1 times [2022-10-16 01:18:57,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:18:57,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284582595] [2022-10-16 01:18:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:18:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:18:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:18:57,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 01:18:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:18:57,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 01:18:57,940 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 01:18:57,941 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (31 of 32 remaining) [2022-10-16 01:18:57,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2022-10-16 01:18:57,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2022-10-16 01:18:57,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2022-10-16 01:18:57,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2022-10-16 01:18:57,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2022-10-16 01:18:57,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2022-10-16 01:18:57,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2022-10-16 01:18:57,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2022-10-16 01:18:57,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2022-10-16 01:18:57,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2022-10-16 01:18:57,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2022-10-16 01:18:57,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2022-10-16 01:18:57,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2022-10-16 01:18:57,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2022-10-16 01:18:57,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2022-10-16 01:18:57,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2022-10-16 01:18:57,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2022-10-16 01:18:57,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2022-10-16 01:18:57,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2022-10-16 01:18:57,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2022-10-16 01:18:57,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2022-10-16 01:18:57,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2022-10-16 01:18:57,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2022-10-16 01:18:57,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2022-10-16 01:18:57,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2022-10-16 01:18:57,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2022-10-16 01:18:57,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2022-10-16 01:18:57,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2022-10-16 01:18:57,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2022-10-16 01:18:57,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2022-10-16 01:18:57,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK (0 of 32 remaining) [2022-10-16 01:18:57,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 01:18:57,956 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-10-16 01:18:57,960 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 01:18:58,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:18:58 BoogieIcfgContainer [2022-10-16 01:18:58,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 01:18:58,006 INFO L158 Benchmark]: Toolchain (without parser) took 3830.36ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 131.8MB in the beginning and 129.3MB in the end (delta: 2.5MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2022-10-16 01:18:58,006 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory was 121.2MB in the beginning and 121.1MB in the end (delta: 79.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 01:18:58,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.22ms. Allocated memory is still 151.0MB. Free memory was 131.6MB in the beginning and 117.9MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-16 01:18:58,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.01ms. Allocated memory is still 151.0MB. Free memory was 117.9MB in the beginning and 129.8MB in the end (delta: -12.0MB). Peak memory consumption was 3.6MB. Max. memory is 8.0GB. [2022-10-16 01:18:58,008 INFO L158 Benchmark]: Boogie Preprocessor took 68.74ms. Allocated memory is still 151.0MB. Free memory was 129.8MB in the beginning and 126.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 01:18:58,008 INFO L158 Benchmark]: RCFGBuilder took 1190.88ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 126.3MB in the beginning and 157.9MB in the end (delta: -31.6MB). Peak memory consumption was 48.6MB. Max. memory is 8.0GB. [2022-10-16 01:18:58,009 INFO L158 Benchmark]: TraceAbstraction took 2065.23ms. Allocated memory is still 181.4MB. Free memory was 157.3MB in the beginning and 129.3MB in the end (delta: 28.0MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. [2022-10-16 01:18:58,011 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.22ms. Allocated memory is still 151.0MB. Free memory was 121.2MB in the beginning and 121.1MB in the end (delta: 79.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 354.22ms. Allocated memory is still 151.0MB. Free memory was 131.6MB in the beginning and 117.9MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 136.01ms. Allocated memory is still 151.0MB. Free memory was 117.9MB in the beginning and 129.8MB in the end (delta: -12.0MB). Peak memory consumption was 3.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.74ms. Allocated memory is still 151.0MB. Free memory was 129.8MB in the beginning and 126.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1190.88ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 126.3MB in the beginning and 157.9MB in the end (delta: -31.6MB). Peak memory consumption was 48.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2065.23ms. Allocated memory is still 181.4MB. Free memory was 157.3MB in the beginning and 129.3MB in the end (delta: 28.0MB). Peak memory consumption was 28.6MB. 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: 177]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 47, overapproximation of bitwiseXOr at line 42, overapproximation of bitwiseOr at line 46, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of bitwiseAnd at line 43, overapproximation of memtrack at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 18. Possible FailurePath: [L20-L23] static const double one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={4:0}] [L171] double x = __VERIFIER_nondet_double(); [L172] double y = 0.0; [L173] CALL, EXPR fmod_double(x, y) [L26] __int32_t n, hx, hy, hz, ix, iy, sx, i; [L27] __uint32_t lx, ly, lz; VAL [\old(x)=4294967309, \old(y)=0, one_fmod=1, x=4294967309, y=0, Zero_fmod={4:0}] [L30] ieee_double_shape_type ew_u; VAL [\old(x)=4294967309, \old(y)=0, ew_u={6:0}, one_fmod=1, x=4294967309, y=0, Zero_fmod={4:0}] [L31] ew_u.value = (x) VAL [\old(x)=4294967309, \old(y)=0, ew_u={6:0}, one_fmod=1, x=4294967309, y=0, Zero_fmod={4:0}] [L32] EXPR ew_u.parts.msw VAL [\old(x)=4294967309, \old(y)=0, ew_u={6:0}, ew_u.parts.msw=0, one_fmod=1, x=4294967309, y=0, Zero_fmod={4:0}] [L32] (hx) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw VAL [\old(x)=4294967309, \old(y)=0, ew_u={6:0}, ew_u.parts.lsw=4294967297, hx=0, one_fmod=1, x=4294967309, y=0, Zero_fmod={4:0}] [L33] (lx) = ew_u.parts.lsw [L36] ieee_double_shape_type ew_u; VAL [\old(x)=4294967309, \old(y)=0, ew_u={5:0}, hx=0, lx=4294967297, one_fmod=1, x=4294967309, y=0, Zero_fmod={4:0}] [L37] ew_u.value = (y) VAL [\old(x)=4294967309, \old(y)=0, ew_u={5:0}, hx=0, lx=4294967297, one_fmod=1, x=4294967309, y=0, Zero_fmod={4:0}] [L38] EXPR ew_u.parts.msw VAL [\old(x)=4294967309, \old(y)=0, ew_u={5:0}, ew_u.parts.msw=4294967295, hx=0, lx=4294967297, one_fmod=1, x=4294967309, y=0, Zero_fmod={4:0}] [L38] (hy) = ew_u.parts.msw [L39] EXPR ew_u.parts.lsw VAL [\old(x)=4294967309, \old(y)=0, ew_u={5:0}, ew_u.parts.lsw=-4294967296, hx=0, hy=-1, lx=4294967297, one_fmod=1, x=4294967309, y=0, Zero_fmod={4:0}] [L39] (ly) = ew_u.parts.lsw [L41] sx = hx & 0x80000000 VAL [\old(x)=4294967309, \old(y)=0, hx=0, hy=-1, lx=4294967297, ly=-4294967296, one_fmod=1, sx=0, x=4294967309, y=0, Zero_fmod={4:0}] [L42] hx ^= sx [L43] hy &= 0x7fffffff VAL [\old(x)=4294967309, \old(y)=0, hx=0, hy=0, lx=4294967297, ly=-4294967296, one_fmod=1, sx=0, x=4294967309, y=0, Zero_fmod={4:0}] [L45-L46] COND TRUE (hy | ly) == 0 || (hx >= 0x7ff00000) || ((hy | ((ly | -ly) >> 31)) > 0x7ff00000) [L47] return (x * y) / (x * y); VAL [\old(x)=4294967309, \old(y)=0, hx=0, hy=0, lx=4294967297, ly=-4294967296, one_fmod=1, sx=0, x=4294967309, y=0, Zero_fmod={4:0}] [L173] RET, EXPR fmod_double(x, y) [L173] double res = fmod_double(x, y); [L176] CALL, EXPR isnan_double(res) [L18] return x != x; VAL [\old(x)=4294967308, \result=0, one_fmod=1, x=4294967308, Zero_fmod={4:0}] [L176] RET, EXPR isnan_double(res) [L176] COND TRUE !isnan_double(res) [L177] reach_error() VAL [one_fmod=1, res=4294967308, x=4294967309, y=0, Zero_fmod={4:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 165]: 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 1 procedures, 142 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 1261 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 567 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 694 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 50 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-16 01:18:58,061 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...