/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_0931.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:44:04,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:44:04,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:44:04,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:44:04,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:44:04,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:44:04,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:44:04,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:44:04,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:44:04,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:44:04,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:44:04,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:44:04,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:44:04,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:44:04,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:44:04,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:44:04,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:44:04,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:44:04,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:44:04,452 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:44:04,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:44:04,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:44:04,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:44:04,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:44:04,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:44:04,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:44:04,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:44:04,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:44:04,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:44:04,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:44:04,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:44:04,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:44:04,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:44:04,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:44:04,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:44:04,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:44:04,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:44:04,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:44:04,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:44:04,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:44:04,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:44:04,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:44:04,553 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:44:04,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:44:04,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:44:04,554 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:44:04,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:44:04,556 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:44:04,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:44:04,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:44:04,559 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:44:04,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:44:04,560 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:44:04,561 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:44:04,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:44:04,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:44:04,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:44:04,561 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:44:04,562 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:44:04,562 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:44:04,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:44:04,562 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:44:04,562 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:44:04,563 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:44:04,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:44:04,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:44:04,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:44:04,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:04,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:44:04,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:44:04,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:44:04,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:44:04,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:44:05,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:44:05,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:44:05,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:44:05,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:44:05,053 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:44:05,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0931.c [2022-10-15 16:44:05,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594c3eaf9/eb661eabaf5f4bdb83b7c9f1e3371446/FLAGfdd6e5c07 [2022-10-15 16:44:05,831 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:44:05,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0931.c [2022-10-15 16:44:05,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594c3eaf9/eb661eabaf5f4bdb83b7c9f1e3371446/FLAGfdd6e5c07 [2022-10-15 16:44:06,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/594c3eaf9/eb661eabaf5f4bdb83b7c9f1e3371446 [2022-10-15 16:44:06,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:44:06,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:44:06,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:06,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:44:06,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:44:06,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602e7e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06, skipping insertion in model container [2022-10-15 16:44:06,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:44:06,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:44:06,586 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_0931.c[3610,3623] [2022-10-15 16:44:06,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:06,602 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:44:06,681 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_0931.c[3610,3623] [2022-10-15 16:44:06,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:06,701 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:44:06,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06 WrapperNode [2022-10-15 16:44:06,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:06,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:06,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:44:06,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:44:06,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,777 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 176 [2022-10-15 16:44:06,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:06,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:44:06,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:44:06,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:44:06,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,825 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:44:06,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:44:06,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:44:06,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:44:06,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (1/1) ... [2022-10-15 16:44:06,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:06,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:44:06,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:44:06,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:44:06,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:44:06,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:44:06,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:44:06,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:44:06,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:44:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:44:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:44:06,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:44:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:44:06,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:44:07,073 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:44:07,076 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:44:07,808 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:44:07,816 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:44:07,816 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-10-15 16:44:07,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:07 BoogieIcfgContainer [2022-10-15 16:44:07,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:44:07,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:44:07,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:44:07,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:44:07,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:44:06" (1/3) ... [2022-10-15 16:44:07,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780893d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:07, skipping insertion in model container [2022-10-15 16:44:07,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:06" (2/3) ... [2022-10-15 16:44:07,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780893d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:07, skipping insertion in model container [2022-10-15 16:44:07,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:07" (3/3) ... [2022-10-15 16:44:07,836 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0931.c [2022-10-15 16:44:07,867 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:44:07,867 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-10-15 16:44:07,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:44:07,942 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;@4f783458, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:44:07,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-10-15 16:44:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 75 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:44:07,956 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:07,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:44:07,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:44:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:44:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:07,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079147809] [2022-10-15 16:44:07,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:07,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:08,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:08,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079147809] [2022-10-15 16:44:08,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079147809] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:08,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:08,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36640087] [2022-10-15 16:44:08,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:08,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:08,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:08,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:08,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:08,431 INFO L87 Difference]: Start difference. First operand has 76 states, 51 states have (on average 1.9411764705882353) internal successors, (99), 75 states have internal predecessors, (99), 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:44:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:08,594 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-10-15 16:44:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:08,603 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:44:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:08,618 INFO L225 Difference]: With dead ends: 73 [2022-10-15 16:44:08,619 INFO L226 Difference]: Without dead ends: 71 [2022-10-15 16:44:08,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:08,629 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 128 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-15 16:44:08,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 128 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-10-15 16:44:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-10-15 16:44:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.66) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-10-15 16:44:08,692 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 4 [2022-10-15 16:44:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:08,693 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-10-15 16:44:08,694 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:44:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-10-15 16:44:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:44:08,694 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:08,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:44:08,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:44:08,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:44:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:44:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:08,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903115256] [2022-10-15 16:44:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:08,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:08,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:08,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903115256] [2022-10-15 16:44:08,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903115256] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:08,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:08,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:08,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231949532] [2022-10-15 16:44:08,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:08,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:08,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:08,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:08,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:08,877 INFO L87 Difference]: Start difference. First operand 71 states and 83 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:44:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:08,943 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-10-15 16:44:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:08,943 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:44:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:08,945 INFO L225 Difference]: With dead ends: 68 [2022-10-15 16:44:08,945 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 16:44:08,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:08,948 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:08,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 129 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 16:44:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-10-15 16:44:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.6) internal successors, (80), 67 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2022-10-15 16:44:08,958 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 4 [2022-10-15 16:44:08,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:08,959 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2022-10-15 16:44:08,959 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:44:08,960 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2022-10-15 16:44:08,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:44:08,960 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:08,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:08,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:44:08,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:44:08,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash 860131841, now seen corresponding path program 1 times [2022-10-15 16:44:08,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:08,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617602033] [2022-10-15 16:44:08,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:08,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:09,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:09,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617602033] [2022-10-15 16:44:09,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617602033] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:09,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:09,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:09,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223351688] [2022-10-15 16:44:09,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:09,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:09,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:09,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:09,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:09,083 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:09,169 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-10-15 16:44:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:09,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:44:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:09,171 INFO L225 Difference]: With dead ends: 65 [2022-10-15 16:44:09,171 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 16:44:09,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:09,173 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 115 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-15 16:44:09,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 115 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 16:44:09,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-10-15 16:44:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.54) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-10-15 16:44:09,185 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 15 [2022-10-15 16:44:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:09,185 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-10-15 16:44:09,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,186 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-10-15 16:44:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:44:09,186 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:09,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:09,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:44:09,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:44:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash 860131842, now seen corresponding path program 1 times [2022-10-15 16:44:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:09,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376628119] [2022-10-15 16:44:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:09,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:09,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376628119] [2022-10-15 16:44:09,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376628119] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:09,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:09,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727745383] [2022-10-15 16:44:09,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:09,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:09,359 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:09,460 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-10-15 16:44:09,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:09,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:44:09,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:09,464 INFO L225 Difference]: With dead ends: 62 [2022-10-15 16:44:09,464 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 16:44:09,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:09,466 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:09,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 120 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 16:44:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-10-15 16:44:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.48) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-10-15 16:44:09,480 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 15 [2022-10-15 16:44:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:09,481 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-10-15 16:44:09,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-10-15 16:44:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:44:09,484 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:09,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:09,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:44:09,485 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:44:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 860115506, now seen corresponding path program 1 times [2022-10-15 16:44:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:09,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672970578] [2022-10-15 16:44:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:09,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:09,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672970578] [2022-10-15 16:44:09,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672970578] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:09,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:09,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:09,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385760647] [2022-10-15 16:44:09,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:09,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:09,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:09,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:09,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:09,634 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:09,693 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-10-15 16:44:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:09,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:44:09,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:09,697 INFO L225 Difference]: With dead ends: 59 [2022-10-15 16:44:09,698 INFO L226 Difference]: Without dead ends: 59 [2022-10-15 16:44:09,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:09,704 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:09,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 108 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-15 16:44:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-10-15 16:44:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.42) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-10-15 16:44:09,713 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 15 [2022-10-15 16:44:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:09,713 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-10-15 16:44:09,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-10-15 16:44:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:44:09,714 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:09,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:09,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:44:09,715 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:44:09,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:09,716 INFO L85 PathProgramCache]: Analyzing trace with hash 860115507, now seen corresponding path program 1 times [2022-10-15 16:44:09,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:09,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218514152] [2022-10-15 16:44:09,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:09,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:09,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:09,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218514152] [2022-10-15 16:44:09,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218514152] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:09,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:09,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984638519] [2022-10-15 16:44:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:09,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:09,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:09,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:09,817 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:09,848 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-10-15 16:44:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:09,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:44:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:09,849 INFO L225 Difference]: With dead ends: 56 [2022-10-15 16:44:09,849 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 16:44:09,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:09,851 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:09,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 112 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 16:44:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-10-15 16:44:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.36) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-10-15 16:44:09,857 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 15 [2022-10-15 16:44:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:09,857 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-10-15 16:44:09,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-10-15 16:44:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:44:09,859 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:09,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:09,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:44:09,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:44:09,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash 830502709, now seen corresponding path program 1 times [2022-10-15 16:44:09,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:09,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102004150] [2022-10-15 16:44:09,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:09,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:09,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:09,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102004150] [2022-10-15 16:44:09,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102004150] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:09,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:09,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:09,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496813166] [2022-10-15 16:44:09,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:09,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:09,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:09,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:09,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:09,954 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:09,999 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-10-15 16:44:10,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:10,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:44:10,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:10,001 INFO L225 Difference]: With dead ends: 54 [2022-10-15 16:44:10,001 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 16:44:10,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:10,003 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:10,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 16:44:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-15 16:44:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.32) internal successors, (66), 53 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-10-15 16:44:10,008 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 15 [2022-10-15 16:44:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:10,008 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-10-15 16:44:10,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-10-15 16:44:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:44:10,010 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:10,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:10,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:44:10,010 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:44:10,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:10,011 INFO L85 PathProgramCache]: Analyzing trace with hash 830502710, now seen corresponding path program 1 times [2022-10-15 16:44:10,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:10,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588672250] [2022-10-15 16:44:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:10,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:10,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588672250] [2022-10-15 16:44:10,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588672250] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:10,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:10,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:10,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423653360] [2022-10-15 16:44:10,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:10,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:10,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:10,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:10,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:10,136 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:10,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:10,177 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-10-15 16:44:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:10,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:44:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:10,179 INFO L225 Difference]: With dead ends: 52 [2022-10-15 16:44:10,179 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 16:44:10,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:10,180 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:10,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 16:44:10,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-10-15 16:44:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-10-15 16:44:10,185 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 15 [2022-10-15 16:44:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:10,185 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-10-15 16:44:10,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-10-15 16:44:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:44:10,187 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:10,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:10,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:44:10,188 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:44:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:10,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1002647357, now seen corresponding path program 1 times [2022-10-15 16:44:10,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:10,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855114692] [2022-10-15 16:44:10,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:10,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:10,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855114692] [2022-10-15 16:44:10,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855114692] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:10,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:10,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:44:10,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088976835] [2022-10-15 16:44:10,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:10,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:44:10,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:10,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:44:10,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:44:10,754 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:10,840 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2022-10-15 16:44:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:44:10,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2022-10-15 16:44:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:10,842 INFO L225 Difference]: With dead ends: 72 [2022-10-15 16:44:10,842 INFO L226 Difference]: Without dead ends: 71 [2022-10-15 16:44:10,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:44:10,844 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 14 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:10,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 168 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-10-15 16:44:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-10-15 16:44:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-10-15 16:44:10,850 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 24 [2022-10-15 16:44:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:10,850 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-10-15 16:44:10,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-10-15 16:44:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:44:10,852 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:10,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:10,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:44:10,853 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-10-15 16:44:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1002647486, now seen corresponding path program 1 times [2022-10-15 16:44:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:10,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765954044] [2022-10-15 16:44:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:10,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:44:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:11,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:44:11,124 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:44:11,125 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2022-10-15 16:44:11,127 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2022-10-15 16:44:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2022-10-15 16:44:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2022-10-15 16:44:11,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2022-10-15 16:44:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2022-10-15 16:44:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2022-10-15 16:44:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2022-10-15 16:44:11,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2022-10-15 16:44:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2022-10-15 16:44:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2022-10-15 16:44:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2022-10-15 16:44:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2022-10-15 16:44:11,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2022-10-15 16:44:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2022-10-15 16:44:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2022-10-15 16:44:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2022-10-15 16:44:11,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2022-10-15 16:44:11,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 24 remaining) [2022-10-15 16:44:11,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2022-10-15 16:44:11,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2022-10-15 16:44:11,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 24 remaining) [2022-10-15 16:44:11,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 24 remaining) [2022-10-15 16:44:11,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2022-10-15 16:44:11,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:44:11,143 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:11,148 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:44:11,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:44:11 BoogieIcfgContainer [2022-10-15 16:44:11,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:44:11,217 INFO L158 Benchmark]: Toolchain (without parser) took 5055.45ms. Allocated memory was 152.0MB in the beginning and 182.5MB in the end (delta: 30.4MB). Free memory was 126.4MB in the beginning and 160.8MB in the end (delta: -34.3MB). Peak memory consumption was 104.4MB. Max. memory is 8.0GB. [2022-10-15 16:44:11,218 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 152.0MB. Free memory was 122.2MB in the beginning and 122.1MB in the end (delta: 61.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:44:11,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.27ms. Allocated memory is still 152.0MB. Free memory was 126.1MB in the beginning and 114.2MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-15 16:44:11,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.07ms. Allocated memory is still 152.0MB. Free memory was 114.2MB in the beginning and 110.6MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:11,219 INFO L158 Benchmark]: Boogie Preprocessor took 57.18ms. Allocated memory is still 152.0MB. Free memory was 110.6MB in the beginning and 107.7MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:11,219 INFO L158 Benchmark]: RCFGBuilder took 982.87ms. Allocated memory is still 152.0MB. Free memory was 107.7MB in the beginning and 116.9MB in the end (delta: -9.2MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2022-10-15 16:44:11,220 INFO L158 Benchmark]: TraceAbstraction took 3389.63ms. Allocated memory was 152.0MB in the beginning and 182.5MB in the end (delta: 30.4MB). Free memory was 116.3MB in the beginning and 160.8MB in the end (delta: -44.4MB). Peak memory consumption was 94.5MB. Max. memory is 8.0GB. [2022-10-15 16:44:11,222 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.29ms. Allocated memory is still 152.0MB. Free memory was 122.2MB in the beginning and 122.1MB in the end (delta: 61.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 531.27ms. Allocated memory is still 152.0MB. Free memory was 126.1MB in the beginning and 114.2MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.07ms. Allocated memory is still 152.0MB. Free memory was 114.2MB in the beginning and 110.6MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.18ms. Allocated memory is still 152.0MB. Free memory was 110.6MB in the beginning and 107.7MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 982.87ms. Allocated memory is still 152.0MB. Free memory was 107.7MB in the beginning and 116.9MB in the end (delta: -9.2MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3389.63ms. Allocated memory was 152.0MB in the beginning and 182.5MB in the end (delta: 30.4MB). Free memory was 116.3MB in the beginning and 160.8MB in the end (delta: -44.4MB). Peak memory consumption was 94.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: 139]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseOr at line 29, overapproximation of someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of bitwiseAnd at line 28, overapproximation of memtrack at line 139. Possible FailurePath: [L34-L43] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L45] static const double zero = 0.0; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L134] double x = 1.0 / 0.0; [L135] CALL, EXPR __ieee754_log(x) [L48] double hfsq, f, s, z, R, w, t1, t2, dk; [L49] __int32_t k, hx, i, j; [L50] __uint32_t lx; VAL [\old(x)=18014398509481998, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L53] ieee_double_shape_type ew_u; VAL [\old(x)=18014398509481998, ew_u={6:0}, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L54] ew_u.value = (x) VAL [\old(x)=18014398509481998, ew_u={6:0}, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L55] EXPR ew_u.parts.msw VAL [\old(x)=18014398509481998, ew_u={6:0}, ew_u.parts.msw=6441402368, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L55] (hx) = ew_u.parts.msw [L56] EXPR ew_u.parts.lsw VAL [\old(x)=18014398509481998, ew_u={6:0}, ew_u.parts.lsw=18014398509481986, hx=2146435072, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481998, zero=0] [L56] (lx) = ew_u.parts.lsw [L59] k = 0 VAL [\old(x)=18014398509481998, hx=2146435072, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=2, two54_log=18014398509481984, x=18014398509481998, zero=0] [L60] COND FALSE !(hx < 0x00100000) VAL [\old(x)=18014398509481998, hx=2146435072, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=2, two54_log=18014398509481984, x=18014398509481998, zero=0] [L73] COND TRUE hx >= 0x7ff00000 [L74] return x + x; VAL [\old(x)=18014398509481998, hx=2146435072, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=2, two54_log=18014398509481984, x=18014398509481998, zero=0] [L135] RET, EXPR __ieee754_log(x) [L135] double res = __ieee754_log(x); [L138] CALL, EXPR isinf_double(res) [L21] __int32_t hx, lx; VAL [\old(x)=18014398509481997, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481997, zero=0] [L23] ieee_double_shape_type ew_u; VAL [\old(x)=18014398509481997, ew_u={5:0}, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481997, zero=0] [L24] ew_u.value = (x) VAL [\old(x)=18014398509481997, ew_u={5:0}, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481997, zero=0] [L25] EXPR ew_u.parts.msw VAL [\old(x)=18014398509481997, ew_u={5:0}, ew_u.parts.msw=4294967295, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481997, zero=0] [L25] (hx) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw VAL [\old(x)=18014398509481997, ew_u={5:0}, ew_u.parts.lsw=4294967296, hx=-1, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481997, zero=0] [L26] (lx) = ew_u.parts.lsw [L28] hx &= 0x7fffffff [L29] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L30] hx = 0x7ff00000 - hx [L31] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=18014398509481997, \result=0, hx=4293918720, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=18014398509481997, zero=0] [L138] RET, EXPR isinf_double(res) [L138] COND TRUE !isinf_double(res) [L139] reach_error() VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, res=18014398509481997, two54_log=18014398509481984, x=18014398509481998, zero=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: 128]: 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, 76 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 1090 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 494 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 276 IncrementalHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 596 mSDtfsCounter, 276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 29, 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, 9 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:44:11,291 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...