/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_0970a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:44:05,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:44:05,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:44:05,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:44:05,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:44:05,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:44:05,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:44:05,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:44:05,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:44:05,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:44:05,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:44:05,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:44:05,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:44:05,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:44:05,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:44:05,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:44:05,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:44:05,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:44:05,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:44:05,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:44:05,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:44:05,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:44:05,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:44:05,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:44:05,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:44:05,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:44:05,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:44:05,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:44:05,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:44:05,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:44:05,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:44:05,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:44:05,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:44:05,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:44:05,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:44:05,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:44:05,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:44:05,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:44:05,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:44:05,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:44:05,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:44:05,681 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:05,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:44:05,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:44:05,743 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:44:05,743 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:44:05,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:44:05,746 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:44:05,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:44:05,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:44:05,749 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:44:05,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:44:05,751 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:44:05,751 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:44:05,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:44:05,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:44:05,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:44:05,752 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:44:05,753 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:44:05,753 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:44:05,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:44:05,753 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:44:05,754 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:44:05,754 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:44:05,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:44:05,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:44:05,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:44:05,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:05,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:44:05,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:44:05,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:44:05,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:44:05,756 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:06,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:44:06,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:44:06,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:44:06,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:44:06,242 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:44:06,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0970a.c [2022-10-15 16:44:06,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d60f6fe7/9c346b150b0d4b5cac5b2d8db434c1a2/FLAG846fb27ce [2022-10-15 16:44:07,045 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:44:07,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0970a.c [2022-10-15 16:44:07,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d60f6fe7/9c346b150b0d4b5cac5b2d8db434c1a2/FLAG846fb27ce [2022-10-15 16:44:07,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d60f6fe7/9c346b150b0d4b5cac5b2d8db434c1a2 [2022-10-15 16:44:07,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:44:07,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:44:07,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:07,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:44:07,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:44:07,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:07" (1/1) ... [2022-10-15 16:44:07,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771435e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:07, skipping insertion in model container [2022-10-15 16:44:07,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:07" (1/1) ... [2022-10-15 16:44:07,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:44:07,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:44:07,439 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_0970a.c[4903,4916] [2022-10-15 16:44:07,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:07,467 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:44:07,582 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_0970a.c[4903,4916] [2022-10-15 16:44:07,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:07,618 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:44:07,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:07 WrapperNode [2022-10-15 16:44:07,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:07,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:07,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:44:07,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:44:07,630 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:07" (1/1) ... [2022-10-15 16:44:07,647 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:07" (1/1) ... [2022-10-15 16:44:07,695 INFO L138 Inliner]: procedures = 19, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 266 [2022-10-15 16:44:07,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:07,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:44:07,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:44:07,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:44:07,710 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:07" (1/1) ... [2022-10-15 16:44:07,711 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:07" (1/1) ... [2022-10-15 16:44:07,716 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:07" (1/1) ... [2022-10-15 16:44:07,716 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:07" (1/1) ... [2022-10-15 16:44:07,748 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:07" (1/1) ... [2022-10-15 16:44:07,762 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:07" (1/1) ... [2022-10-15 16:44:07,771 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:07" (1/1) ... [2022-10-15 16:44:07,776 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:07" (1/1) ... [2022-10-15 16:44:07,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:44:07,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:44:07,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:44:07,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:44:07,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:07" (1/1) ... [2022-10-15 16:44:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:07,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:44:07,845 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:07,851 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:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:44:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:44:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:44:07,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:44:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:44:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:44:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:44:07,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:44:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:44:07,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:44:08,027 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:44:08,030 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:44:08,974 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:44:08,989 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:44:08,990 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-10-15 16:44:08,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:08 BoogieIcfgContainer [2022-10-15 16:44:08,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:44:08,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:44:08,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:44:09,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:44:09,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:44:07" (1/3) ... [2022-10-15 16:44:09,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dd69e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:09, skipping insertion in model container [2022-10-15 16:44:09,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:07" (2/3) ... [2022-10-15 16:44:09,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dd69e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:09, skipping insertion in model container [2022-10-15 16:44:09,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:08" (3/3) ... [2022-10-15 16:44:09,006 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0970a.c [2022-10-15 16:44:09,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:44:09,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-10-15 16:44:09,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:44:09,101 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;@6593daca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:44:09,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-10-15 16:44:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 83 states have (on average 1.9397590361445782) internal successors, (161), 121 states have internal predecessors, (161), 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,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:44:09,120 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:09,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:44:09,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:09,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 28693828, now seen corresponding path program 1 times [2022-10-15 16:44:09,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:09,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450002836] [2022-10-15 16:44:09,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:09,441 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,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:09,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450002836] [2022-10-15 16:44:09,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450002836] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:09,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:09,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496038086] [2022-10-15 16:44:09,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:09,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:09,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:09,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:09,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:09,489 INFO L87 Difference]: Start difference. First operand has 122 states, 83 states have (on average 1.9397590361445782) internal successors, (161), 121 states have internal predecessors, (161), 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.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:09,649 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2022-10-15 16:44:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:09,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:44:09,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:09,666 INFO L225 Difference]: With dead ends: 120 [2022-10-15 16:44:09,667 INFO L226 Difference]: Without dead ends: 118 [2022-10-15 16:44:09,669 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,674 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 4 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:09,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 224 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-15 16:44:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-10-15 16:44:09,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 117 states have internal predecessors, (140), 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,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 140 transitions. [2022-10-15 16:44:09,740 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 140 transitions. Word has length 5 [2022-10-15 16:44:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:09,742 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 140 transitions. [2022-10-15 16:44:09,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2022-10-15 16:44:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:44:09,749 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:09,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:44:09,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:44:09,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2022-10-15 16:44:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742421974] [2022-10-15 16:44:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:10,003 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,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:10,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742421974] [2022-10-15 16:44:10,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742421974] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:10,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:10,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556801634] [2022-10-15 16:44:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:10,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:10,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:10,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:10,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:10,009 INFO L87 Difference]: Start difference. First operand 118 states and 140 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:10,148 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2022-10-15 16:44:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:10,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:44:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:10,159 INFO L225 Difference]: With dead ends: 116 [2022-10-15 16:44:10,160 INFO L226 Difference]: Without dead ends: 116 [2022-10-15 16:44:10,161 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,166 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 2 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:10,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 229 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-15 16:44:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-10-15 16:44:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.6829268292682926) internal successors, (138), 115 states have internal predecessors, (138), 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,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2022-10-15 16:44:10,181 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 5 [2022-10-15 16:44:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:10,182 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2022-10-15 16:44:10,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2022-10-15 16:44:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:44:10,183 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:10,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:44:10,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:44:10,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:10,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash 890247561, now seen corresponding path program 1 times [2022-10-15 16:44:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:10,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476862013] [2022-10-15 16:44:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:10,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:10,226 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,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:10,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476862013] [2022-10-15 16:44:10,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476862013] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:10,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:10,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:44:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731654242] [2022-10-15 16:44:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:10,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:10,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:10,231 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:10,260 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2022-10-15 16:44:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:10,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-10-15 16:44:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:10,267 INFO L225 Difference]: With dead ends: 117 [2022-10-15 16:44:10,267 INFO L226 Difference]: Without dead ends: 117 [2022-10-15 16:44:10,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:10,271 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:10,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-10-15 16:44:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-10-15 16:44:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.6746987951807228) internal successors, (139), 116 states have internal predecessors, (139), 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,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2022-10-15 16:44:10,300 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 6 [2022-10-15 16:44:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:10,301 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2022-10-15 16:44:10,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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,301 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2022-10-15 16:44:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:44:10,302 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:10,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:44:10,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:44:10,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:10,306 INFO L85 PathProgramCache]: Analyzing trace with hash 890511635, now seen corresponding path program 1 times [2022-10-15 16:44:10,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:10,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782418303] [2022-10-15 16:44:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:10,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:10,395 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,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:10,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782418303] [2022-10-15 16:44:10,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782418303] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:10,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:10,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:10,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116508252] [2022-10-15 16:44:10,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:10,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:10,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:10,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:10,399 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:10,508 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2022-10-15 16:44:10,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:10,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-10-15 16:44:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:10,512 INFO L225 Difference]: With dead ends: 119 [2022-10-15 16:44:10,513 INFO L226 Difference]: Without dead ends: 116 [2022-10-15 16:44:10,514 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,526 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:10,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 222 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-15 16:44:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-10-15 16:44:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.670731707317073) internal successors, (137), 115 states have internal predecessors, (137), 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,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2022-10-15 16:44:10,552 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 6 [2022-10-15 16:44:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:10,553 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2022-10-15 16:44:10,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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,554 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2022-10-15 16:44:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:44:10,555 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:10,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:10,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:44:10,557 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash -212149197, now seen corresponding path program 1 times [2022-10-15 16:44:10,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:10,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963589583] [2022-10-15 16:44:10,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:10,806 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,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:10,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963589583] [2022-10-15 16:44:10,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963589583] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:10,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:10,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:10,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234066484] [2022-10-15 16:44:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:10,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:10,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:10,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:10,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:10,811 INFO L87 Difference]: Start difference. First operand 116 states and 137 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:10,893 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-10-15 16:44:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-10-15 16:44:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:10,895 INFO L225 Difference]: With dead ends: 113 [2022-10-15 16:44:10,895 INFO L226 Difference]: Without dead ends: 113 [2022-10-15 16:44:10,895 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,897 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:10,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 208 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-10-15 16:44:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-10-15 16:44:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 112 states have internal predecessors, (134), 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,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2022-10-15 16:44:10,905 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 13 [2022-10-15 16:44:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:10,905 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2022-10-15 16:44:10,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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,906 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-10-15 16:44:10,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:44:10,906 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:10,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:10,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:44:10,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash -212149196, now seen corresponding path program 1 times [2022-10-15 16:44:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:10,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983487464] [2022-10-15 16:44:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:11,119 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:11,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:11,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983487464] [2022-10-15 16:44:11,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983487464] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:11,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:11,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:11,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552907935] [2022-10-15 16:44:11,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:11,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:11,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:11,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:11,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:11,124 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:11,209 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2022-10-15 16:44:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-10-15 16:44:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:11,211 INFO L225 Difference]: With dead ends: 110 [2022-10-15 16:44:11,212 INFO L226 Difference]: Without dead ends: 110 [2022-10-15 16:44:11,212 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:11,213 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:11,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 216 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-15 16:44:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-10-15 16:44:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 109 states have internal predecessors, (131), 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:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2022-10-15 16:44:11,221 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 13 [2022-10-15 16:44:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:11,221 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2022-10-15 16:44:11,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2022-10-15 16:44:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:44:11,223 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:11,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:11,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:44:11,223 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:11,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash -211885123, now seen corresponding path program 1 times [2022-10-15 16:44:11,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:11,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372883521] [2022-10-15 16:44:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:11,374 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:11,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:11,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372883521] [2022-10-15 16:44:11,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372883521] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:11,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:11,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:44:11,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415055800] [2022-10-15 16:44:11,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:11,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:44:11,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:11,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:44:11,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:44:11,378 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:11,488 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2022-10-15 16:44:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:44:11,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-10-15 16:44:11,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:11,490 INFO L225 Difference]: With dead ends: 112 [2022-10-15 16:44:11,490 INFO L226 Difference]: Without dead ends: 110 [2022-10-15 16:44:11,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:44:11,491 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:11,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 285 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-15 16:44:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-10-15 16:44:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.5853658536585367) internal successors, (130), 109 states have internal predecessors, (130), 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:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2022-10-15 16:44:11,498 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 13 [2022-10-15 16:44:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:11,499 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2022-10-15 16:44:11,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:11,499 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2022-10-15 16:44:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:44:11,500 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:11,500 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:11,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:44:11,501 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:11,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:11,502 INFO L85 PathProgramCache]: Analyzing trace with hash -30780730, now seen corresponding path program 1 times [2022-10-15 16:44:11,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:11,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077602247] [2022-10-15 16:44:11,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:11,610 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:11,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:11,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077602247] [2022-10-15 16:44:11,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077602247] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:11,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:11,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423497473] [2022-10-15 16:44:11,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:11,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:11,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:11,614 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:11,695 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-10-15 16:44:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:11,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:11,697 INFO L225 Difference]: With dead ends: 108 [2022-10-15 16:44:11,697 INFO L226 Difference]: Without dead ends: 108 [2022-10-15 16:44:11,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:11,699 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:11,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 202 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-15 16:44:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-10-15 16:44:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 107 states have internal predecessors, (128), 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:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-10-15 16:44:11,705 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 24 [2022-10-15 16:44:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:11,705 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-10-15 16:44:11,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-10-15 16:44:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:44:11,707 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:11,707 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:11,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:44:11,708 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash -30780729, now seen corresponding path program 1 times [2022-10-15 16:44:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:11,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087982671] [2022-10-15 16:44:11,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:11,895 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:11,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:11,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087982671] [2022-10-15 16:44:11,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087982671] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:11,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:11,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648697003] [2022-10-15 16:44:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:11,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:11,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:11,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:11,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:11,899 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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:11,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:11,964 INFO L93 Difference]: Finished difference Result 106 states and 126 transitions. [2022-10-15 16:44:11,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:11,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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:11,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:11,966 INFO L225 Difference]: With dead ends: 106 [2022-10-15 16:44:11,966 INFO L226 Difference]: Without dead ends: 106 [2022-10-15 16:44:11,966 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:11,967 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:11,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 210 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-15 16:44:11,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-10-15 16:44:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 105 states have internal predecessors, (126), 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:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2022-10-15 16:44:11,972 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 24 [2022-10-15 16:44:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:11,973 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2022-10-15 16:44:11,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2022-10-15 16:44:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:44:11,974 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:11,974 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, 1] [2022-10-15 16:44:11,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:44:11,975 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -36207720, now seen corresponding path program 1 times [2022-10-15 16:44:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:11,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596875683] [2022-10-15 16:44:11,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:12,076 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:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:12,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596875683] [2022-10-15 16:44:12,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596875683] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:12,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:12,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010205961] [2022-10-15 16:44:12,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:12,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:12,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:12,080 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:12,147 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2022-10-15 16:44:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:12,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-10-15 16:44:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:12,149 INFO L225 Difference]: With dead ends: 103 [2022-10-15 16:44:12,149 INFO L226 Difference]: Without dead ends: 103 [2022-10-15 16:44:12,150 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:12,151 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 6 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:12,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 192 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-15 16:44:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-10-15 16:44:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.5) internal successors, (123), 102 states have internal predecessors, (123), 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:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2022-10-15 16:44:12,155 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 25 [2022-10-15 16:44:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:12,156 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2022-10-15 16:44:12,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2022-10-15 16:44:12,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:44:12,157 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:12,157 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, 1] [2022-10-15 16:44:12,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:44:12,158 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:12,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash -36207719, now seen corresponding path program 1 times [2022-10-15 16:44:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:12,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254874213] [2022-10-15 16:44:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:12,317 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:12,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:12,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254874213] [2022-10-15 16:44:12,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254874213] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:12,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:12,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:12,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739197838] [2022-10-15 16:44:12,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:12,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:12,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:12,321 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:12,390 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2022-10-15 16:44:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:12,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-10-15 16:44:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:12,392 INFO L225 Difference]: With dead ends: 100 [2022-10-15 16:44:12,392 INFO L226 Difference]: Without dead ends: 100 [2022-10-15 16:44:12,392 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:12,393 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:12,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 200 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-15 16:44:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-10-15 16:44:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 99 states have internal predecessors, (120), 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:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2022-10-15 16:44:12,398 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 25 [2022-10-15 16:44:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:12,399 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2022-10-15 16:44:12,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2022-10-15 16:44:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:44:12,400 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:12,400 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, 1] [2022-10-15 16:44:12,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:44:12,401 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:44:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:12,402 INFO L85 PathProgramCache]: Analyzing trace with hash -32284284, now seen corresponding path program 1 times [2022-10-15 16:44:12,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:12,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779563444] [2022-10-15 16:44:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:12,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:44:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:12,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:44:12,510 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:44:12,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2022-10-15 16:44:12,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2022-10-15 16:44:12,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2022-10-15 16:44:12,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2022-10-15 16:44:12,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2022-10-15 16:44:12,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2022-10-15 16:44:12,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2022-10-15 16:44:12,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2022-10-15 16:44:12,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2022-10-15 16:44:12,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2022-10-15 16:44:12,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2022-10-15 16:44:12,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2022-10-15 16:44:12,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2022-10-15 16:44:12,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2022-10-15 16:44:12,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2022-10-15 16:44:12,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2022-10-15 16:44:12,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2022-10-15 16:44:12,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2022-10-15 16:44:12,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2022-10-15 16:44:12,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2022-10-15 16:44:12,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2022-10-15 16:44:12,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2022-10-15 16:44:12,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2022-10-15 16:44:12,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2022-10-15 16:44:12,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2022-10-15 16:44:12,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2022-10-15 16:44:12,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2022-10-15 16:44:12,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2022-10-15 16:44:12,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2022-10-15 16:44:12,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2022-10-15 16:44:12,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2022-10-15 16:44:12,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 38 remaining) [2022-10-15 16:44:12,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 38 remaining) [2022-10-15 16:44:12,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 38 remaining) [2022-10-15 16:44:12,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 38 remaining) [2022-10-15 16:44:12,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 38 remaining) [2022-10-15 16:44:12,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 38 remaining) [2022-10-15 16:44:12,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2022-10-15 16:44:12,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:44:12,528 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:12,533 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:44:12,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:44:12 BoogieIcfgContainer [2022-10-15 16:44:12,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:44:12,622 INFO L158 Benchmark]: Toolchain (without parser) took 5540.86ms. Allocated memory was 151.0MB in the beginning and 221.2MB in the end (delta: 70.3MB). Free memory was 123.4MB in the beginning and 103.8MB in the end (delta: 19.6MB). Peak memory consumption was 91.4MB. Max. memory is 8.0GB. [2022-10-15 16:44:12,622 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 151.0MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:44:12,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.28ms. Allocated memory is still 151.0MB. Free memory was 123.2MB in the beginning and 110.3MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 16:44:12,623 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.90ms. Allocated memory is still 151.0MB. Free memory was 110.2MB in the beginning and 107.2MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:12,623 INFO L158 Benchmark]: Boogie Preprocessor took 91.97ms. Allocated memory is still 151.0MB. Free memory was 107.2MB in the beginning and 104.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:12,624 INFO L158 Benchmark]: RCFGBuilder took 1202.00ms. Allocated memory is still 151.0MB. Free memory was 104.7MB in the beginning and 110.9MB in the end (delta: -6.2MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:12,624 INFO L158 Benchmark]: TraceAbstraction took 3623.87ms. Allocated memory was 151.0MB in the beginning and 221.2MB in the end (delta: 70.3MB). Free memory was 110.3MB in the beginning and 103.8MB in the end (delta: 6.5MB). Peak memory consumption was 77.3MB. Max. memory is 8.0GB. [2022-10-15 16:44:12,626 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.33ms. Allocated memory is still 151.0MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 530.28ms. Allocated memory is still 151.0MB. Free memory was 123.2MB in the beginning and 110.3MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.90ms. Allocated memory is still 151.0MB. Free memory was 110.2MB in the beginning and 107.2MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 91.97ms. Allocated memory is still 151.0MB. Free memory was 107.2MB in the beginning and 104.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1202.00ms. Allocated memory is still 151.0MB. Free memory was 104.7MB in the beginning and 110.9MB in the end (delta: -6.2MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3623.87ms. Allocated memory was 151.0MB in the beginning and 221.2MB in the end (delta: 70.3MB). Free memory was 110.3MB in the beginning and 103.8MB in the end (delta: 6.5MB). Peak memory consumption was 77.3MB. 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: 190]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseAnd at line 172, overapproximation of someBinaryArithmeticDOUBLEoperation at line 147, overapproximation of memtrack at line 190, overapproximation of someBinaryDOUBLEComparisonOperation at line 163. Possible FailurePath: [L19-L28] 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; [L30] static const double zero = 0.0; [L113-L116] static const double two54_log10 = 1.80143985094819840000e+16, ivln10_log10 = 4.34294481903251816668e-01, log10_2hi_log10 = 3.01029995663611771306e-01, log10_2lo_log10 = 3.69423907715893078616e-13; [L118] static const double zero_log10 = 0.0; VAL [ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L182] double x = __VERIFIER_nondet_double(); [L184] x < 0 && isfinite_double(x) [L184] CALL, EXPR isfinite_double(x) [L166] __int32_t hx; VAL [\old(x)=18014398509481998, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L168] ieee_double_shape_type gh_u; VAL [\old(x)=18014398509481998, gh_u={6:0}, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L169] gh_u.value = (x) VAL [\old(x)=18014398509481998, gh_u={6:0}, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L170] EXPR gh_u.parts.msw VAL [\old(x)=18014398509481998, gh_u={6:0}, gh_u.parts.msw=4294967295, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L170] (hx) = gh_u.parts.msw [L172] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=18014398509481998, \result=1, hx=-1, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L184] RET, EXPR isfinite_double(x) [L184] x < 0 && isfinite_double(x) VAL [isfinite_double(x)=1, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, x < 0 && isfinite_double(x)=1, zero=0, zero_log10=0] [L184] COND TRUE x < 0 && isfinite_double(x) [L186] CALL, EXPR __ieee754_log10(x) [L121] double y, z; [L122] __int32_t i, k, hx; [L123] __uint32_t lx; VAL [\old(x)=18014398509481998, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L126] ieee_double_shape_type ew_u; VAL [\old(x)=18014398509481998, ew_u={5:0}, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L127] ew_u.value = (x) VAL [\old(x)=18014398509481998, ew_u={5:0}, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L128] EXPR ew_u.parts.msw VAL [\old(x)=18014398509481998, ew_u={5:0}, ew_u.parts.msw=6441402368, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L128] (hx) = ew_u.parts.msw [L129] EXPR ew_u.parts.lsw VAL [\old(x)=18014398509481998, ew_u={5:0}, ew_u.parts.lsw=18014398509481986, hx=2146435072, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L129] (lx) = ew_u.parts.lsw [L132] k = 0 VAL [\old(x)=18014398509481998, hx=2146435072, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=2, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L133] COND FALSE !(hx < 0x00100000) VAL [\old(x)=18014398509481998, hx=2146435072, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=2, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L146] COND TRUE hx >= 0x7ff00000 [L147] return x + x; VAL [\old(x)=18014398509481998, hx=2146435072, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=2, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] [L186] RET, EXPR __ieee754_log10(x) [L186] double res = __ieee754_log10(x); [L189] CALL, EXPR isnan_double(res) [L163] return x != x; VAL [\old(x)=18014398509481997, \result=0, ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481997, zero=0, zero_log10=0] [L189] RET, EXPR isnan_double(res) [L189] COND TRUE !isnan_double(res) [L190] reach_error() VAL [ivln10_log10=108573620475812954167/250000000000000000000, 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, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, res=18014398509481997, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481998, zero=0, zero_log10=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 175]: 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, 122 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 2457 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1053 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 517 IncrementalHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1404 mSDtfsCounter, 517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=0, InterpolantAutomatonStates: 34, 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:12,694 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...