/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/float_req_bl_1271a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:46:06,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:46:06,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:46:06,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:46:06,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:46:06,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:46:06,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:46:06,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:46:06,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:46:06,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:46:06,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:46:06,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:46:06,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:46:06,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:46:06,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:46:06,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:46:06,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:46:06,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:46:06,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:46:06,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:46:06,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:46:06,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:46:06,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:46:06,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:46:06,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:46:06,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:46:06,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:46:06,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:46:06,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:46:06,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:46:06,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:46:06,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:46:06,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:46:06,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:46:06,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:46:06,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:46:06,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:46:06,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:46:06,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:46:06,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:46:06,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:46:06,734 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:46:06,796 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:46:06,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:46:06,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:46:06,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:46:06,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:46:06,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:46:06,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:46:06,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:46:06,804 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:46:06,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:46:06,804 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:46:06,806 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:46:06,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:46:06,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:46:06,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:46:06,807 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:46:06,808 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:46:06,808 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:46:06,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:46:06,808 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:46:06,809 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:46:06,809 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:46:06,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:46:06,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:46:06,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:46:06,811 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:46:06,811 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:46:06,811 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:46:06,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:46:06,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:46:06,812 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:46:07,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:46:07,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:46:07,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:46:07,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:46:07,334 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:46:07,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1271a.c [2022-10-15 16:46:07,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f04c2873/b11fff3cbc894d5897f98393f113b972/FLAG4a7a77e3f [2022-10-15 16:46:08,152 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:46:08,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1271a.c [2022-10-15 16:46:08,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f04c2873/b11fff3cbc894d5897f98393f113b972/FLAG4a7a77e3f [2022-10-15 16:46:08,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f04c2873/b11fff3cbc894d5897f98393f113b972 [2022-10-15 16:46:08,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:46:08,192 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:46:08,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:46:08,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:46:08,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:46:08,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b330ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08, skipping insertion in model container [2022-10-15 16:46:08,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:46:08,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:46:08,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1271a.c[4883,4896] [2022-10-15 16:46:08,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:46:08,494 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:46:08,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1271a.c[4883,4896] [2022-10-15 16:46:08,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:46:08,574 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:46:08,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08 WrapperNode [2022-10-15 16:46:08,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:46:08,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:46:08,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:46:08,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:46:08,585 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:46:08" (1/1) ... [2022-10-15 16:46:08,601 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:46:08" (1/1) ... [2022-10-15 16:46:08,642 INFO L138 Inliner]: procedures = 19, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 262 [2022-10-15 16:46:08,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:46:08,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:46:08,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:46:08,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:46:08,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,733 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:46:08,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:46:08,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:46:08,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:46:08,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08" (1/1) ... [2022-10-15 16:46:08,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:46:08,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:46:08,803 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:46:08,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:46:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:46:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:46:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:46:08,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:46:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:46:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:46:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:46:08,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:46:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:46:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:46:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-10-15 16:46:08,874 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-10-15 16:46:08,999 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:46:09,002 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:46:10,007 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:46:10,023 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:46:10,023 INFO L300 CfgBuilder]: Removed 34 assume(true) statements. [2022-10-15 16:46:10,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:46:10 BoogieIcfgContainer [2022-10-15 16:46:10,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:46:10,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:46:10,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:46:10,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:46:10,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:46:08" (1/3) ... [2022-10-15 16:46:10,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556e2613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:46:10, skipping insertion in model container [2022-10-15 16:46:10,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:08" (2/3) ... [2022-10-15 16:46:10,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556e2613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:46:10, skipping insertion in model container [2022-10-15 16:46:10,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:46:10" (3/3) ... [2022-10-15 16:46:10,038 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1271a.c [2022-10-15 16:46:10,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:46:10,062 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-10-15 16:46:10,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:46:10,139 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;@14eee93b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:46:10,139 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2022-10-15 16:46:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 142 states have (on average 1.9295774647887325) internal successors, (274), 208 states have internal predecessors, (274), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:46:10,153 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:10,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:46:10,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:46:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:10,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383133205] [2022-10-15 16:46:10,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:10,503 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:46:10,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:10,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383133205] [2022-10-15 16:46:10,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383133205] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:10,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:10,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:10,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276483798] [2022-10-15 16:46:10,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:10,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:10,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:10,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:10,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:10,568 INFO L87 Difference]: Start difference. First operand has 212 states, 142 states have (on average 1.9295774647887325) internal successors, (274), 208 states have internal predecessors, (274), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:10,862 INFO L93 Difference]: Finished difference Result 210 states and 236 transitions. [2022-10-15 16:46:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:10,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:46:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:10,878 INFO L225 Difference]: With dead ends: 210 [2022-10-15 16:46:10,878 INFO L226 Difference]: Without dead ends: 208 [2022-10-15 16:46:10,880 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:46:10,885 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:10,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 367 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:46:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-10-15 16:46:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-10-15 16:46:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 141 states have (on average 1.6312056737588652) internal successors, (230), 204 states have internal predecessors, (230), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:10,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2022-10-15 16:46:10,951 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 4 [2022-10-15 16:46:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:10,952 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2022-10-15 16:46:10,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2022-10-15 16:46:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:46:10,953 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:10,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:46:10,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:46:10,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:10,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:46:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:10,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348939458] [2022-10-15 16:46:10,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:11,101 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:46:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:11,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348939458] [2022-10-15 16:46:11,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348939458] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:11,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:11,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:11,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096806287] [2022-10-15 16:46:11,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:11,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:11,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:11,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:11,107 INFO L87 Difference]: Start difference. First operand 208 states and 234 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:11,272 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2022-10-15 16:46:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:46:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:11,275 INFO L225 Difference]: With dead ends: 206 [2022-10-15 16:46:11,276 INFO L226 Difference]: Without dead ends: 206 [2022-10-15 16:46:11,276 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:46:11,278 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:11,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 380 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-15 16:46:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-10-15 16:46:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 141 states have (on average 1.6170212765957446) internal successors, (228), 202 states have internal predecessors, (228), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 232 transitions. [2022-10-15 16:46:11,302 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 232 transitions. Word has length 4 [2022-10-15 16:46:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:11,302 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 232 transitions. [2022-10-15 16:46:11,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:46:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2022-10-15 16:46:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:46:11,304 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:11,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:11,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:46:11,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:11,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:11,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1129736101, now seen corresponding path program 1 times [2022-10-15 16:46:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:11,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302098302] [2022-10-15 16:46:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:11,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:11,511 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:46:11,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:11,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302098302] [2022-10-15 16:46:11,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302098302] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:11,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:11,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:46:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230349765] [2022-10-15 16:46:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:11,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:46:11,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:11,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:46:11,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:46:11,519 INFO L87 Difference]: Start difference. First operand 206 states and 232 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:46:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:11,777 INFO L93 Difference]: Finished difference Result 208 states and 233 transitions. [2022-10-15 16:46:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:46:11,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-10-15 16:46:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:11,779 INFO L225 Difference]: With dead ends: 208 [2022-10-15 16:46:11,780 INFO L226 Difference]: Without dead ends: 206 [2022-10-15 16:46:11,780 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:46:11,782 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:11,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 492 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:46:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-15 16:46:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-10-15 16:46:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 141 states have (on average 1.6099290780141844) internal successors, (227), 202 states have internal predecessors, (227), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 231 transitions. [2022-10-15 16:46:11,797 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 231 transitions. Word has length 12 [2022-10-15 16:46:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:11,797 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 231 transitions. [2022-10-15 16:46:11,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:46:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 231 transitions. [2022-10-15 16:46:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:46:11,798 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:11,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:11,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:46:11,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1130063727, now seen corresponding path program 1 times [2022-10-15 16:46:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:11,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500683581] [2022-10-15 16:46:11,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:11,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:11,876 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:46:11,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:11,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500683581] [2022-10-15 16:46:11,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500683581] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:11,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:11,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:11,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142355503] [2022-10-15 16:46:11,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:11,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:11,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:11,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:11,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:11,880 INFO L87 Difference]: Start difference. First operand 206 states and 231 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:46:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:12,004 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2022-10-15 16:46:12,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:12,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-10-15 16:46:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:12,006 INFO L225 Difference]: With dead ends: 204 [2022-10-15 16:46:12,007 INFO L226 Difference]: Without dead ends: 204 [2022-10-15 16:46:12,007 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:46:12,009 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 4 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:12,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 355 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-10-15 16:46:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-10-15 16:46:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 200 states have internal predecessors, (225), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 229 transitions. [2022-10-15 16:46:12,020 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 229 transitions. Word has length 12 [2022-10-15 16:46:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:12,021 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 229 transitions. [2022-10-15 16:46:12,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:46:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 229 transitions. [2022-10-15 16:46:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:46:12,022 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:12,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:12,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:46:12,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:12,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1130063726, now seen corresponding path program 1 times [2022-10-15 16:46:12,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:12,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400011927] [2022-10-15 16:46:12,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:12,158 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:46:12,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:12,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400011927] [2022-10-15 16:46:12,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400011927] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:12,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:12,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:12,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159924629] [2022-10-15 16:46:12,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:12,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:12,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:12,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:12,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:12,164 INFO L87 Difference]: Start difference. First operand 204 states and 229 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:46:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:12,267 INFO L93 Difference]: Finished difference Result 202 states and 227 transitions. [2022-10-15 16:46:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:12,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-10-15 16:46:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:12,269 INFO L225 Difference]: With dead ends: 202 [2022-10-15 16:46:12,269 INFO L226 Difference]: Without dead ends: 202 [2022-10-15 16:46:12,269 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:46:12,271 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 2 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:12,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 372 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:12,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-10-15 16:46:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-10-15 16:46:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 141 states have (on average 1.5815602836879432) internal successors, (223), 198 states have internal predecessors, (223), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 227 transitions. [2022-10-15 16:46:12,280 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 227 transitions. Word has length 12 [2022-10-15 16:46:12,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:12,281 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 227 transitions. [2022-10-15 16:46:12,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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:46:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 227 transitions. [2022-10-15 16:46:12,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:46:12,282 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:12,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:12,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:46:12,283 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:12,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1681446362, now seen corresponding path program 1 times [2022-10-15 16:46:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:12,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414598022] [2022-10-15 16:46:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:12,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:12,365 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:46:12,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:12,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414598022] [2022-10-15 16:46:12,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414598022] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:12,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:12,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058764102] [2022-10-15 16:46:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:12,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:12,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:12,369 INFO L87 Difference]: Start difference. First operand 202 states and 227 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:46:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:12,516 INFO L93 Difference]: Finished difference Result 200 states and 225 transitions. [2022-10-15 16:46:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-10-15 16:46:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:12,519 INFO L225 Difference]: With dead ends: 200 [2022-10-15 16:46:12,519 INFO L226 Difference]: Without dead ends: 200 [2022-10-15 16:46:12,519 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:46:12,521 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:12,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 349 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-10-15 16:46:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-10-15 16:46:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 141 states have (on average 1.5673758865248226) internal successors, (221), 196 states have internal predecessors, (221), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2022-10-15 16:46:12,529 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 18 [2022-10-15 16:46:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:12,530 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2022-10-15 16:46:12,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:46:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2022-10-15 16:46:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:46:12,531 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:12,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:12,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:46:12,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1681446363, now seen corresponding path program 1 times [2022-10-15 16:46:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:12,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928048557] [2022-10-15 16:46:12,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:12,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:12,709 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:46:12,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:12,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928048557] [2022-10-15 16:46:12,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928048557] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:12,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:12,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:12,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194922958] [2022-10-15 16:46:12,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:12,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:12,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:12,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:12,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:12,715 INFO L87 Difference]: Start difference. First operand 200 states and 225 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:46:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:12,824 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-10-15 16:46:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:12,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-10-15 16:46:12,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:12,829 INFO L225 Difference]: With dead ends: 198 [2022-10-15 16:46:12,829 INFO L226 Difference]: Without dead ends: 198 [2022-10-15 16:46:12,829 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:46:12,835 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 2 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:12,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 366 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-10-15 16:46:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-10-15 16:46:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.553191489361702) internal successors, (219), 194 states have internal predecessors, (219), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2022-10-15 16:46:12,847 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 18 [2022-10-15 16:46:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:12,848 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2022-10-15 16:46:12,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:46:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2022-10-15 16:46:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:46:12,849 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:12,849 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:46:12,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:46:12,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash 418748775, now seen corresponding path program 1 times [2022-10-15 16:46:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:12,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768060140] [2022-10-15 16:46:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:12,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:12,992 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:46:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768060140] [2022-10-15 16:46:12,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768060140] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:12,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:12,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:12,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853085823] [2022-10-15 16:46:12,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:12,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:12,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:12,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:12,996 INFO L87 Difference]: Start difference. First operand 198 states and 223 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:46:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:13,100 INFO L93 Difference]: Finished difference Result 196 states and 221 transitions. [2022-10-15 16:46:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:13,101 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:46:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:13,103 INFO L225 Difference]: With dead ends: 196 [2022-10-15 16:46:13,103 INFO L226 Difference]: Without dead ends: 196 [2022-10-15 16:46:13,103 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:46:13,104 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 4 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:13,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 343 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-10-15 16:46:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-10-15 16:46:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 192 states have internal predecessors, (217), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2022-10-15 16:46:13,112 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 25 [2022-10-15 16:46:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:13,113 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2022-10-15 16:46:13,113 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:46:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2022-10-15 16:46:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:46:13,114 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:13,114 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:46:13,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:46:13,115 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:13,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:13,116 INFO L85 PathProgramCache]: Analyzing trace with hash 418748776, now seen corresponding path program 1 times [2022-10-15 16:46:13,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:13,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348936266] [2022-10-15 16:46:13,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:13,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:13,243 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:46:13,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:13,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348936266] [2022-10-15 16:46:13,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348936266] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:13,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:13,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384176285] [2022-10-15 16:46:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:13,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:13,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:13,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:13,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:13,247 INFO L87 Difference]: Start difference. First operand 196 states and 221 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:46:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:13,338 INFO L93 Difference]: Finished difference Result 194 states and 219 transitions. [2022-10-15 16:46:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:13,342 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:46:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:13,343 INFO L225 Difference]: With dead ends: 194 [2022-10-15 16:46:13,344 INFO L226 Difference]: Without dead ends: 194 [2022-10-15 16:46:13,344 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:46:13,347 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:13,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 360 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-10-15 16:46:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-10-15 16:46:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 141 states have (on average 1.524822695035461) internal successors, (215), 190 states have internal predecessors, (215), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 219 transitions. [2022-10-15 16:46:13,359 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 219 transitions. Word has length 25 [2022-10-15 16:46:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:13,361 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 219 transitions. [2022-10-15 16:46:13,361 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:46:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2022-10-15 16:46:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:46:13,362 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:13,363 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, 1, 1, 1, 1, 1] [2022-10-15 16:46:13,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:46:13,363 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash 4111312, now seen corresponding path program 1 times [2022-10-15 16:46:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:13,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286458364] [2022-10-15 16:46:13,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:13,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:13,462 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:46:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:13,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286458364] [2022-10-15 16:46:13,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286458364] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:13,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:13,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274690512] [2022-10-15 16:46:13,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:13,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:13,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:13,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:13,466 INFO L87 Difference]: Start difference. First operand 194 states and 219 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:46:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:13,583 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2022-10-15 16:46:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:13,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2022-10-15 16:46:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:13,585 INFO L225 Difference]: With dead ends: 192 [2022-10-15 16:46:13,585 INFO L226 Difference]: Without dead ends: 192 [2022-10-15 16:46:13,586 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:46:13,586 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 4 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:13,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 337 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-10-15 16:46:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-10-15 16:46:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 141 states have (on average 1.5106382978723405) internal successors, (213), 188 states have internal predecessors, (213), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 217 transitions. [2022-10-15 16:46:13,593 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 217 transitions. Word has length 30 [2022-10-15 16:46:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:13,594 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 217 transitions. [2022-10-15 16:46:13,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:46:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 217 transitions. [2022-10-15 16:46:13,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:46:13,595 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:13,596 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, 1, 1, 1, 1, 1] [2022-10-15 16:46:13,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:46:13,596 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:13,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:13,597 INFO L85 PathProgramCache]: Analyzing trace with hash 4111313, now seen corresponding path program 1 times [2022-10-15 16:46:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:13,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641537525] [2022-10-15 16:46:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:13,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:13,789 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:46:13,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:13,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641537525] [2022-10-15 16:46:13,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641537525] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:13,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:13,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:13,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927314017] [2022-10-15 16:46:13,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:13,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:13,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:13,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:13,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:13,793 INFO L87 Difference]: Start difference. First operand 192 states and 217 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:46:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:13,881 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2022-10-15 16:46:13,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:13,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2022-10-15 16:46:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:13,885 INFO L225 Difference]: With dead ends: 190 [2022-10-15 16:46:13,885 INFO L226 Difference]: Without dead ends: 190 [2022-10-15 16:46:13,886 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:46:13,887 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:13,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 354 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-10-15 16:46:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-10-15 16:46:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 141 states have (on average 1.49645390070922) internal successors, (211), 186 states have internal predecessors, (211), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 16:46:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2022-10-15 16:46:13,902 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 30 [2022-10-15 16:46:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:13,902 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2022-10-15 16:46:13,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:46:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2022-10-15 16:46:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 16:46:13,908 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:13,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:13,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:46:13,910 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2022-10-15 16:46:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash 531348252, now seen corresponding path program 1 times [2022-10-15 16:46:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:13,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895975129] [2022-10-15 16:46:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:46:13,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:46:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:46:14,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:46:14,128 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:46:14,130 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK (65 of 66 remaining) [2022-10-15 16:46:14,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 66 remaining) [2022-10-15 16:46:14,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 66 remaining) [2022-10-15 16:46:14,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 66 remaining) [2022-10-15 16:46:14,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 66 remaining) [2022-10-15 16:46:14,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 66 remaining) [2022-10-15 16:46:14,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 66 remaining) [2022-10-15 16:46:14,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 66 remaining) [2022-10-15 16:46:14,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 66 remaining) [2022-10-15 16:46:14,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 66 remaining) [2022-10-15 16:46:14,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 66 remaining) [2022-10-15 16:46:14,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 66 remaining) [2022-10-15 16:46:14,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 66 remaining) [2022-10-15 16:46:14,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 66 remaining) [2022-10-15 16:46:14,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 66 remaining) [2022-10-15 16:46:14,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 66 remaining) [2022-10-15 16:46:14,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 66 remaining) [2022-10-15 16:46:14,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 66 remaining) [2022-10-15 16:46:14,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 66 remaining) [2022-10-15 16:46:14,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 66 remaining) [2022-10-15 16:46:14,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 66 remaining) [2022-10-15 16:46:14,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 66 remaining) [2022-10-15 16:46:14,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 66 remaining) [2022-10-15 16:46:14,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 66 remaining) [2022-10-15 16:46:14,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 66 remaining) [2022-10-15 16:46:14,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 66 remaining) [2022-10-15 16:46:14,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 66 remaining) [2022-10-15 16:46:14,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 66 remaining) [2022-10-15 16:46:14,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 66 remaining) [2022-10-15 16:46:14,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 66 remaining) [2022-10-15 16:46:14,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 66 remaining) [2022-10-15 16:46:14,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 66 remaining) [2022-10-15 16:46:14,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 66 remaining) [2022-10-15 16:46:14,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 66 remaining) [2022-10-15 16:46:14,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 66 remaining) [2022-10-15 16:46:14,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 66 remaining) [2022-10-15 16:46:14,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 66 remaining) [2022-10-15 16:46:14,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 66 remaining) [2022-10-15 16:46:14,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 66 remaining) [2022-10-15 16:46:14,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 66 remaining) [2022-10-15 16:46:14,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 66 remaining) [2022-10-15 16:46:14,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 66 remaining) [2022-10-15 16:46:14,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 66 remaining) [2022-10-15 16:46:14,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 66 remaining) [2022-10-15 16:46:14,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 66 remaining) [2022-10-15 16:46:14,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 66 remaining) [2022-10-15 16:46:14,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 66 remaining) [2022-10-15 16:46:14,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 66 remaining) [2022-10-15 16:46:14,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 66 remaining) [2022-10-15 16:46:14,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 66 remaining) [2022-10-15 16:46:14,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 66 remaining) [2022-10-15 16:46:14,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 66 remaining) [2022-10-15 16:46:14,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 66 remaining) [2022-10-15 16:46:14,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 66 remaining) [2022-10-15 16:46:14,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 66 remaining) [2022-10-15 16:46:14,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 66 remaining) [2022-10-15 16:46:14,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 66 remaining) [2022-10-15 16:46:14,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK (8 of 66 remaining) [2022-10-15 16:46:14,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 66 remaining) [2022-10-15 16:46:14,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 66 remaining) [2022-10-15 16:46:14,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 66 remaining) [2022-10-15 16:46:14,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 66 remaining) [2022-10-15 16:46:14,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 66 remaining) [2022-10-15 16:46:14,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 66 remaining) [2022-10-15 16:46:14,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 66 remaining) [2022-10-15 16:46:14,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ieee754_sqrtfErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 66 remaining) [2022-10-15 16:46:14,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:46:14,153 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:14,158 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:46:14,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:46:14 BoogieIcfgContainer [2022-10-15 16:46:14,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:46:14,227 INFO L158 Benchmark]: Toolchain (without parser) took 6040.31ms. Allocated memory was 156.2MB in the beginning and 189.8MB in the end (delta: 33.6MB). Free memory was 130.9MB in the beginning and 102.9MB in the end (delta: 27.9MB). Peak memory consumption was 63.0MB. Max. memory is 8.0GB. [2022-10-15 16:46:14,227 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 156.2MB. Free memory was 126.4MB in the beginning and 126.4MB in the end (delta: 82.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:46:14,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.60ms. Allocated memory is still 156.2MB. Free memory was 130.6MB in the beginning and 117.1MB in the end (delta: 13.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 16:46:14,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.64ms. Allocated memory is still 156.2MB. Free memory was 117.1MB in the beginning and 114.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:46:14,228 INFO L158 Benchmark]: Boogie Preprocessor took 108.38ms. Allocated memory is still 156.2MB. Free memory was 114.7MB in the beginning and 112.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:46:14,233 INFO L158 Benchmark]: RCFGBuilder took 1273.38ms. Allocated memory is still 156.2MB. Free memory was 112.1MB in the beginning and 112.3MB in the end (delta: -205.6kB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-10-15 16:46:14,233 INFO L158 Benchmark]: TraceAbstraction took 4197.20ms. Allocated memory was 156.2MB in the beginning and 189.8MB in the end (delta: 33.6MB). Free memory was 111.8MB in the beginning and 102.9MB in the end (delta: 8.8MB). Peak memory consumption was 43.9MB. Max. memory is 8.0GB. [2022-10-15 16:46:14,235 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.31ms. Allocated memory is still 156.2MB. Free memory was 126.4MB in the beginning and 126.4MB in the end (delta: 82.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 381.60ms. Allocated memory is still 156.2MB. Free memory was 130.6MB in the beginning and 117.1MB in the end (delta: 13.5MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.64ms. Allocated memory is still 156.2MB. Free memory was 117.1MB in the beginning and 114.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 108.38ms. Allocated memory is still 156.2MB. Free memory was 114.7MB in the beginning and 112.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1273.38ms. Allocated memory is still 156.2MB. Free memory was 112.1MB in the beginning and 112.3MB in the end (delta: -205.6kB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4197.20ms. Allocated memory was 156.2MB in the beginning and 189.8MB in the end (delta: 33.6MB). Free memory was 111.8MB in the beginning and 102.9MB in the end (delta: 8.8MB). Peak memory consumption was 43.9MB. 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: 241]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 213, overapproximation of bitwiseAnd at line 98, overapproximation of memtrack at line 241, overapproximation of someBinaryArithmeticFLOAToperation at line 120. Possible FailurePath: [L14] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L234] float x = 0.0f / 0.0f; [L235] float y = __VERIFIER_nondet_float(); [L237] CALL isfinite_float(y) [L217] __int32_t ix; VAL [\old(x)=4294967327, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967327] [L219] ieee_float_shape_type gf_u; VAL [\old(x)=4294967327, gf_u={6:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967327] [L220] gf_u.value = (x) VAL [\old(x)=4294967327, gf_u={6:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967327] [L221] EXPR gf_u.word VAL [\old(x)=4294967327, gf_u={6:0}, gf_u.word=4294967306, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967327] [L221] (ix) = gf_u.word [L223] ix &= 0x7fffffff [L224] return (((ix) < 0x7f800000L)); VAL [\old(x)=4294967327, \result=1, ix=2139095039, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967327] [L237] RET isfinite_float(y) [L237] COND TRUE isfinite_float(y) [L238] CALL, EXPR __ieee754_hypotf(x, y) [L84] float a = x, b = y, t1, t2, y1, y2, w; [L85] __int32_t j, k, ha, hb; VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967330, b=4294967327, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L88] ieee_float_shape_type gf_u; VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967330, b=4294967327, gf_u={7:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L89] gf_u.value = (x) VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967330, b=4294967327, gf_u={7:0}, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L90] EXPR gf_u.word VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967330, b=4294967327, gf_u={7:0}, gf_u.word=4294967307, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L90] (ha) = gf_u.word [L92] ha &= 0x7fffffffL VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967330, b=4294967327, ha=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L94] ieee_float_shape_type gf_u; VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967330, b=4294967327, gf_u={8:0}, ha=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L95] gf_u.value = (y) VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967330, b=4294967327, gf_u={8:0}, ha=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L96] EXPR gf_u.word VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967330, b=4294967327, gf_u={8:0}, gf_u.word=-2147483649, ha=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L96] (hb) = gf_u.word [L98] hb &= 0x7fffffffL VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967330, b=4294967327, ha=-251658240, hb=1, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L99] COND TRUE hb > ha [L100] a = y [L101] b = x [L102] j = ha [L103] ha = hb [L104] hb = j VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967327, b=4294967330, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L110] ieee_float_shape_type sf_u; VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967327, b=4294967330, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={9:0}, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L111] sf_u.word = (ha) VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967327, b=4294967330, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={9:0}, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L112] EXPR sf_u.value VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967327, b=4294967330, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={9:0}, sf_u.value=4294967328, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L112] (a) = sf_u.value [L115] ieee_float_shape_type sf_u; VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967328, b=4294967330, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={5:0}, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L116] sf_u.word = (hb) VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967328, b=4294967330, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={5:0}, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L117] EXPR sf_u.value VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967328, b=4294967330, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, sf_u={5:0}, sf_u.value=4294967331, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L117] (b) = sf_u.value [L119] COND TRUE (ha - hb) > 0xf000000L [L120] return a + b; VAL [\old(x)=4294967330, \old(y)=4294967327, a=4294967328, b=4294967331, ha=1, hb=-251658240, j=-251658240, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] [L238] RET, EXPR __ieee754_hypotf(x, y) [L238] float res = __ieee754_hypotf(x, y); [L240] CALL, EXPR isnan_float(res) [L213] return x != x; VAL [\old(x)=4294967329, \result=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967329] [L240] RET, EXPR isnan_float(res) [L240] COND TRUE !isnan_float(res) [L241] reach_error() VAL [one_sqrt=1, res=4294967329, tiny_sqrt=1/1000000000000000000000000000000, x=4294967330, y=4294967327] - 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: -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: 227]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 212 locations, 66 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 4075 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1644 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1059 IncrementalHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 2431 mSDtfsCounter, 1059 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred 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.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 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:46:14,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...