/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_0831.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:22,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:22,063 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:22,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:22,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:22,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:22,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:22,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:22,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:22,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:22,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:22,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:22,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:22,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:22,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:22,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:22,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:22,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:22,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:22,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:22,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:22,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:22,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:22,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:22,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:22,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:22,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:22,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:22,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:22,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:22,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:22,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:22,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:22,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:22,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:22,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:22,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:22,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:22,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:22,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:22,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:22,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:45:22,315 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:22,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:22,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:22,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:22,320 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:22,321 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:22,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:22,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:22,324 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:22,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:22,326 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:22,326 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:22,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:22,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:22,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:22,327 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:22,328 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:22,328 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:22,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:22,328 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:22,329 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:22,329 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:22,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:22,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:22,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:22,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:22,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:22,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:22,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:22,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:22,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:45:22,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:22,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:22,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:22,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:22,811 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:22,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0831.c [2022-10-15 16:45:22,930 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e71c411/5487cdcd0efd49d59c6b26ebcffec33b/FLAG12317ced0 [2022-10-15 16:45:23,606 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:23,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0831.c [2022-10-15 16:45:23,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e71c411/5487cdcd0efd49d59c6b26ebcffec33b/FLAG12317ced0 [2022-10-15 16:45:23,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e71c411/5487cdcd0efd49d59c6b26ebcffec33b [2022-10-15 16:45:23,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:23,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:23,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:23,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:23,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:23,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:23" (1/1) ... [2022-10-15 16:45:23,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f7d4e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:23, skipping insertion in model container [2022-10-15 16:45:23,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:23" (1/1) ... [2022-10-15 16:45:23,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:24,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:24,278 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_0831.c[3205,3218] [2022-10-15 16:45:24,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:24,306 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:24,385 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_0831.c[3205,3218] [2022-10-15 16:45:24,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:24,408 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:24,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24 WrapperNode [2022-10-15 16:45:24,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:24,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:24,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:24,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:24,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,471 INFO L138 Inliner]: procedures = 18, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 191 [2022-10-15 16:45:24,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:24,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:24,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:24,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:24,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,519 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:24,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:24,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:24,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:24,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (1/1) ... [2022-10-15 16:45:24,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:24,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:24,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:45:24,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:45:24,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:24,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:24,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:24,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:24,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:24,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:24,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:24,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:24,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:24,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:45:24,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:24,870 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:24,873 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:25,523 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:25,532 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:25,532 INFO L300 CfgBuilder]: Removed 10 assume(true) statements. [2022-10-15 16:45:25,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:25 BoogieIcfgContainer [2022-10-15 16:45:25,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:25,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:25,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:25,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:25,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:23" (1/3) ... [2022-10-15 16:45:25,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2c86f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:25, skipping insertion in model container [2022-10-15 16:45:25,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:24" (2/3) ... [2022-10-15 16:45:25,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2c86f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:25, skipping insertion in model container [2022-10-15 16:45:25,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:25" (3/3) ... [2022-10-15 16:45:25,546 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0831.c [2022-10-15 16:45:25,571 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:25,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-10-15 16:45:25,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:25,643 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;@1752ecbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:25,643 INFO L358 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2022-10-15 16:45:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 99 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:25,657 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:25,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:25,658 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-15 16:45:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:45:25,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:25,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482292578] [2022-10-15 16:45:25,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:25,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:25,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:25,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482292578] [2022-10-15 16:45:25,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482292578] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:25,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:25,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:25,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094380835] [2022-10-15 16:45:25,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:25,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:25,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:25,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:25,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:26,003 INFO L87 Difference]: Start difference. First operand has 100 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 99 states have internal predecessors, (129), 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-15 16:45:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:26,111 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-10-15 16:45:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:26,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:45:26,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:26,125 INFO L225 Difference]: With dead ends: 97 [2022-10-15 16:45:26,126 INFO L226 Difference]: Without dead ends: 95 [2022-10-15 16:45:26,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:26,133 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:26,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 173 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-15 16:45:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-10-15 16:45:26,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.676923076923077) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2022-10-15 16:45:26,188 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 4 [2022-10-15 16:45:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:26,189 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2022-10-15 16:45:26,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2022-10-15 16:45:26,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:26,190 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:26,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:26,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:26,191 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-15 16:45:26,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:45:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:26,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355029146] [2022-10-15 16:45:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:26,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:26,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:26,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355029146] [2022-10-15 16:45:26,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355029146] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:26,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:26,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:26,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29435290] [2022-10-15 16:45:26,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:26,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:26,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:26,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:26,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:26,398 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:26,485 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2022-10-15 16:45:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:26,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:45:26,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:26,488 INFO L225 Difference]: With dead ends: 93 [2022-10-15 16:45:26,488 INFO L226 Difference]: Without dead ends: 93 [2022-10-15 16:45:26,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:26,491 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:26,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 175 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-10-15 16:45:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-10-15 16:45:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.646153846153846) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2022-10-15 16:45:26,503 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 4 [2022-10-15 16:45:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:26,504 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2022-10-15 16:45:26,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2022-10-15 16:45:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:45:26,505 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:26,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:26,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:26,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:45:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:26,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1241365306, now seen corresponding path program 1 times [2022-10-15 16:45:26,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:26,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813524251] [2022-10-15 16:45:26,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:26,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:26,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:26,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813524251] [2022-10-15 16:45:26,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813524251] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:26,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:26,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322247976] [2022-10-15 16:45:26,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:26,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:26,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:26,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:26,685 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:26,758 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2022-10-15 16:45:26,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:26,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:45:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:26,767 INFO L225 Difference]: With dead ends: 148 [2022-10-15 16:45:26,767 INFO L226 Difference]: Without dead ends: 148 [2022-10-15 16:45:26,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:26,775 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 58 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:26,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 193 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-10-15 16:45:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 99. [2022-10-15 16:45:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.6056338028169015) internal successors, (114), 98 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2022-10-15 16:45:26,808 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 14 [2022-10-15 16:45:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:26,808 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2022-10-15 16:45:26,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2022-10-15 16:45:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:45:26,809 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:26,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:26,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:26,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 29 more)] === [2022-10-15 16:45:26,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:26,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1371844853, now seen corresponding path program 1 times [2022-10-15 16:45:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:26,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497412989] [2022-10-15 16:45:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:26,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:26,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:26,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497412989] [2022-10-15 16:45:26,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497412989] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:26,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:26,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:26,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103225038] [2022-10-15 16:45:26,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:26,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:26,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:26,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:26,886 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:26,958 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2022-10-15 16:45:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:26,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-10-15 16:45:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:26,965 INFO L225 Difference]: With dead ends: 182 [2022-10-15 16:45:26,965 INFO L226 Difference]: Without dead ends: 182 [2022-10-15 16:45:26,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:26,971 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 92 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:26,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 232 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-10-15 16:45:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 106. [2022-10-15 16:45:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.5897435897435896) internal successors, (124), 105 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2022-10-15 16:45:26,996 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 16 [2022-10-15 16:45:26,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:26,997 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2022-10-15 16:45:26,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2022-10-15 16:45:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:45:26,999 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:26,999 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:45:27,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:27,000 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-15 16:45:27,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash -752970897, now seen corresponding path program 1 times [2022-10-15 16:45:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:27,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012195419] [2022-10-15 16:45:27,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:27,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:27,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:45:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:27,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:45:27,146 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:45:27,147 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (31 of 32 remaining) [2022-10-15 16:45:27,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 32 remaining) [2022-10-15 16:45:27,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 32 remaining) [2022-10-15 16:45:27,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 32 remaining) [2022-10-15 16:45:27,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 32 remaining) [2022-10-15 16:45:27,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 32 remaining) [2022-10-15 16:45:27,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 32 remaining) [2022-10-15 16:45:27,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 32 remaining) [2022-10-15 16:45:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 32 remaining) [2022-10-15 16:45:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 32 remaining) [2022-10-15 16:45:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 32 remaining) [2022-10-15 16:45:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 32 remaining) [2022-10-15 16:45:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 32 remaining) [2022-10-15 16:45:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 32 remaining) [2022-10-15 16:45:27,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 32 remaining) [2022-10-15 16:45:27,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 32 remaining) [2022-10-15 16:45:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 32 remaining) [2022-10-15 16:45:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 32 remaining) [2022-10-15 16:45:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 32 remaining) [2022-10-15 16:45:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 32 remaining) [2022-10-15 16:45:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 32 remaining) [2022-10-15 16:45:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 32 remaining) [2022-10-15 16:45:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 32 remaining) [2022-10-15 16:45:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 32 remaining) [2022-10-15 16:45:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 32 remaining) [2022-10-15 16:45:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 32 remaining) [2022-10-15 16:45:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 32 remaining) [2022-10-15 16:45:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 32 remaining) [2022-10-15 16:45:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 32 remaining) [2022-10-15 16:45:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 32 remaining) [2022-10-15 16:45:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 32 remaining) [2022-10-15 16:45:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK (0 of 32 remaining) [2022-10-15 16:45:27,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:27,175 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-10-15 16:45:27,180 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:45:27,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:45:27 BoogieIcfgContainer [2022-10-15 16:45:27,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:45:27,244 INFO L158 Benchmark]: Toolchain (without parser) took 3280.76ms. Allocated memory is still 151.0MB. Free memory was 125.6MB in the beginning and 125.3MB in the end (delta: 267.3kB). Peak memory consumption was 81.5MB. Max. memory is 8.0GB. [2022-10-15 16:45:27,244 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:27,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.85ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 113.2MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-15 16:45:27,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.68ms. Allocated memory is still 151.0MB. Free memory was 113.2MB in the beginning and 111.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:27,250 INFO L158 Benchmark]: Boogie Preprocessor took 62.14ms. Allocated memory is still 151.0MB. Free memory was 111.0MB in the beginning and 109.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:27,251 INFO L158 Benchmark]: RCFGBuilder took 999.80ms. Allocated memory is still 151.0MB. Free memory was 109.1MB in the beginning and 121.7MB in the end (delta: -12.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-10-15 16:45:27,252 INFO L158 Benchmark]: TraceAbstraction took 1705.32ms. Allocated memory is still 151.0MB. Free memory was 121.1MB in the beginning and 125.3MB in the end (delta: -4.2MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2022-10-15 16:45:27,257 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 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 436.85ms. Allocated memory is still 151.0MB. Free memory was 125.4MB in the beginning and 113.2MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.68ms. Allocated memory is still 151.0MB. Free memory was 113.2MB in the beginning and 111.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.14ms. Allocated memory is still 151.0MB. Free memory was 111.0MB in the beginning and 109.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 999.80ms. Allocated memory is still 151.0MB. Free memory was 109.1MB in the beginning and 121.7MB in the end (delta: -12.6MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1705.32ms. Allocated memory is still 151.0MB. Free memory was 121.1MB in the beginning and 125.3MB in the end (delta: -4.2MB). Peak memory consumption was 76.5MB. 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: 123]: 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 21, overapproximation of memtrack at line 123, overapproximation of someBinaryArithmeticFLOAToperation at line 52. Possible FailurePath: [L17-L36] static const float one_exp = 1.0, halF_exp[2] = { 0.5, -0.5, }, huge_exp = 1.0e+30, twom100_exp = 7.8886090522e-31, ln2HI_exp[2] = { 6.9313812256e-01, -6.9313812256e-01, }, ln2LO_exp[2] = { 9.0580006145e-06, -9.0580006145e-06, }, invln2_exp = 1.4426950216e+00, P1_exp = 1.6666667163e-01, P2_exp = -2.7777778450e-03, P3_exp = 6.6137559770e-05, P4_exp = -1.6533901999e-06, P5_exp = 4.1381369442e-08; VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000] [L118] float x = 0.0f / 0.0f; [L119] CALL, EXPR __ieee754_expf(x) [L39] float y, hi, lo, c, t; [L40] __int32_t k = 0, xsb, sx; [L41] __uint32_t hx; VAL [\old(x)=1000000000000000000000000000002, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002] [L44] ieee_float_shape_type gf_u; VAL [\old(x)=1000000000000000000000000000002, gf_u={7:0}, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002] [L45] gf_u.value = (x) VAL [\old(x)=1000000000000000000000000000002, gf_u={7:0}, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002] [L46] EXPR gf_u.word VAL [\old(x)=1000000000000000000000000000002, gf_u={7:0}, gf_u.word=6442450943, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002] [L46] (sx) = gf_u.word [L48] xsb = (sx >> 31) & 1 VAL [\old(x)=1000000000000000000000000000002, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002, xsb=0] [L49] hx = sx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx=2139095041, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002, xsb=0] [L51] COND TRUE ((hx) > 0x7f800000L) [L52] return x + x; VAL [\old(x)=1000000000000000000000000000002, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx=2139095041, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002, xsb=0] [L119] RET, EXPR __ieee754_expf(x) [L119] float res = __ieee754_expf(x); [L122] CALL, EXPR isnan_float(res) [L15] return x != x; VAL [\old(x)=1000000000000000000000000000001, \result=0, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001] [L122] RET, EXPR isnan_float(res) [L122] COND TRUE !isnan_float(res) [L123] reach_error() VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, res=1000000000000000000000000000001, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002] - 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: 113]: 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, 100 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 773 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 452 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=4, 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, 125 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 54 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:45:27,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...