/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_1130a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:55,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:55,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:55,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:55,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:55,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:55,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:55,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:55,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:55,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:55,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:55,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:55,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:55,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:55,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:55,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:55,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:55,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:55,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:55,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:55,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:55,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:55,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:55,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:55,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:55,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:55,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:55,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:55,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:55,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:55,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:55,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:55,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:55,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:55,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:55,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:55,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:55,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:55,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:55,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:55,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:55,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:45:55,226 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:55,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:55,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:55,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:55,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:55,228 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:55,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:55,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:55,229 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:55,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:55,230 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:55,230 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:55,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:55,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:55,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:55,231 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:55,231 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:55,232 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:55,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:55,232 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:55,232 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:55,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:55,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:55,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:55,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:55,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:55,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:55,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:55,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:55,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:55,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:45:55,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:55,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:55,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:55,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:55,691 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:55,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1130a.c [2022-10-15 16:45:55,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06af924ba/f542a1a007e64821a4e0082c57e9b62a/FLAGd070dbe9a [2022-10-15 16:45:56,545 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:56,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1130a.c [2022-10-15 16:45:56,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06af924ba/f542a1a007e64821a4e0082c57e9b62a/FLAGd070dbe9a [2022-10-15 16:45:56,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06af924ba/f542a1a007e64821a4e0082c57e9b62a [2022-10-15 16:45:56,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:56,588 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:56,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:56,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:56,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:56,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:56" (1/1) ... [2022-10-15 16:45:56,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7058c693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:56, skipping insertion in model container [2022-10-15 16:45:56,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:56" (1/1) ... [2022-10-15 16:45:56,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:56,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:56,941 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_1130a.c[2907,2920] [2022-10-15 16:45:56,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:56,962 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:57,060 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_1130a.c[2907,2920] [2022-10-15 16:45:57,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:57,096 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:57,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57 WrapperNode [2022-10-15 16:45:57,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:57,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:57,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:57,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:57,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,223 INFO L138 Inliner]: procedures = 18, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 223 [2022-10-15 16:45:57,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:57,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:57,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:57,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:57,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,313 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:57,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:57,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:57,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:57,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (1/1) ... [2022-10-15 16:45:57,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:57,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:57,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:45:57,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:45:57,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:57,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:57,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:57,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:57,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:57,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:57,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:57,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:57,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:57,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:45:57,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:57,587 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:57,590 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:58,147 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:58,164 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:58,164 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-10-15 16:45:58,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:58 BoogieIcfgContainer [2022-10-15 16:45:58,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:58,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:58,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:58,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:58,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:56" (1/3) ... [2022-10-15 16:45:58,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63289269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:58, skipping insertion in model container [2022-10-15 16:45:58,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:57" (2/3) ... [2022-10-15 16:45:58,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63289269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:58, skipping insertion in model container [2022-10-15 16:45:58,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:58" (3/3) ... [2022-10-15 16:45:58,183 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1130a.c [2022-10-15 16:45:58,209 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:58,209 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-10-15 16:45:58,306 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:58,329 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;@24f2d73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:58,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-10-15 16:45:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 79 states have (on average 1.9240506329113924) internal successors, (152), 107 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:45:58,344 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:58,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:45:58,345 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:45:58,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash 28693828, now seen corresponding path program 1 times [2022-10-15 16:45:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:58,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692370187] [2022-10-15 16:45:58,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:58,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:58,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:58,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692370187] [2022-10-15 16:45:58,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692370187] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:58,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:58,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:58,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397391971] [2022-10-15 16:45:58,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:58,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:58,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:58,687 INFO L87 Difference]: Start difference. First operand has 108 states, 79 states have (on average 1.9240506329113924) internal successors, (152), 107 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:58,858 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-10-15 16:45:58,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:58,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:45:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:58,874 INFO L225 Difference]: With dead ends: 106 [2022-10-15 16:45:58,875 INFO L226 Difference]: Without dead ends: 104 [2022-10-15 16:45:58,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:58,882 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:58,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 208 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-15 16:45:58,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-10-15 16:45:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.6025641025641026) internal successors, (125), 103 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2022-10-15 16:45:58,952 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 5 [2022-10-15 16:45:58,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:58,953 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2022-10-15 16:45:58,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-10-15 16:45:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:45:58,954 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:58,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:45:58,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:58,956 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:45:58,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:58,957 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2022-10-15 16:45:58,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:58,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18755738] [2022-10-15 16:45:58,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:59,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:59,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18755738] [2022-10-15 16:45:59,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18755738] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:59,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:59,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:59,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469513233] [2022-10-15 16:45:59,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:59,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:59,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:59,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:59,149 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:59,249 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2022-10-15 16:45:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:59,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:45:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:59,254 INFO L225 Difference]: With dead ends: 102 [2022-10-15 16:45:59,254 INFO L226 Difference]: Without dead ends: 102 [2022-10-15 16:45:59,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:59,257 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 2 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:59,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 211 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:59,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-15 16:45:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-10-15 16:45:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.5769230769230769) internal successors, (123), 101 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-10-15 16:45:59,282 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 5 [2022-10-15 16:45:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:59,286 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-10-15 16:45:59,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-10-15 16:45:59,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:45:59,287 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:59,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:45:59,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:59,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:45:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash 29003580, now seen corresponding path program 1 times [2022-10-15 16:45:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:59,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838443021] [2022-10-15 16:45:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:59,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:59,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838443021] [2022-10-15 16:45:59,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838443021] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:59,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:59,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492013273] [2022-10-15 16:45:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:59,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:59,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:59,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:59,368 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:59,440 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2022-10-15 16:45:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:59,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:45:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:59,443 INFO L225 Difference]: With dead ends: 104 [2022-10-15 16:45:59,443 INFO L226 Difference]: Without dead ends: 102 [2022-10-15 16:45:59,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:59,446 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:59,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 206 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-15 16:45:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-10-15 16:45:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.564102564102564) internal successors, (122), 101 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2022-10-15 16:45:59,456 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 5 [2022-10-15 16:45:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:59,457 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2022-10-15 16:45:59,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2022-10-15 16:45:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:45:59,458 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:59,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:59,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:59,459 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:45:59,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1296383344, now seen corresponding path program 1 times [2022-10-15 16:45:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:59,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279615041] [2022-10-15 16:45:59,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:59,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:59,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:59,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279615041] [2022-10-15 16:45:59,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279615041] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:59,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:59,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992611813] [2022-10-15 16:45:59,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:59,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:59,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:59,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:59,577 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:59,650 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2022-10-15 16:45:59,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:59,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-10-15 16:45:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:59,652 INFO L225 Difference]: With dead ends: 100 [2022-10-15 16:45:59,652 INFO L226 Difference]: Without dead ends: 100 [2022-10-15 16:45:59,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:59,655 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:59,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:59,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-15 16:45:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-10-15 16:45:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.5384615384615385) internal successors, (120), 99 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2022-10-15 16:45:59,666 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 10 [2022-10-15 16:45:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:59,667 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2022-10-15 16:45:59,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2022-10-15 16:45:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:45:59,668 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:59,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:59,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:59,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:45:59,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1296383343, now seen corresponding path program 1 times [2022-10-15 16:45:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:59,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201031959] [2022-10-15 16:45:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:59,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:59,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201031959] [2022-10-15 16:45:59,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201031959] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:59,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:59,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886883795] [2022-10-15 16:45:59,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:59,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:59,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:59,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:59,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:59,865 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:59,936 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-10-15 16:45:59,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:59,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-10-15 16:45:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:59,939 INFO L225 Difference]: With dead ends: 98 [2022-10-15 16:45:59,939 INFO L226 Difference]: Without dead ends: 98 [2022-10-15 16:45:59,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:59,949 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:59,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 203 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-15 16:45:59,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-10-15 16:45:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 97 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-10-15 16:45:59,967 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 10 [2022-10-15 16:45:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:59,968 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-10-15 16:45:59,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-10-15 16:45:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:45:59,970 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:59,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:59,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:59,978 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:45:59,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:59,979 INFO L85 PathProgramCache]: Analyzing trace with hash -971746833, now seen corresponding path program 1 times [2022-10-15 16:45:59,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:59,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605788360] [2022-10-15 16:45:59,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:00,643 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:00,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:00,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605788360] [2022-10-15 16:46:00,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605788360] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:00,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:00,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:46:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508545493] [2022-10-15 16:46:00,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:00,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:46:00,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:00,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:46:00,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:46:00,646 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:00,800 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions. [2022-10-15 16:46:00,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:46:00,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-10-15 16:46:00,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:00,803 INFO L225 Difference]: With dead ends: 154 [2022-10-15 16:46:00,803 INFO L226 Difference]: Without dead ends: 154 [2022-10-15 16:46:00,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:46:00,805 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 204 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:00,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 255 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:00,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-10-15 16:46:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 95. [2022-10-15 16:46:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 94 states have internal predecessors, (115), 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:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2022-10-15 16:46:00,816 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 19 [2022-10-15 16:46:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:00,816 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2022-10-15 16:46:00,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2022-10-15 16:46:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:46:00,817 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:00,818 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:00,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:46:00,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:46:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash -971746834, now seen corresponding path program 1 times [2022-10-15 16:46:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:00,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536234891] [2022-10-15 16:46:00,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:00,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:01,093 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:01,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:01,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536234891] [2022-10-15 16:46:01,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536234891] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:01,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:01,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:46:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098971964] [2022-10-15 16:46:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:01,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:46:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:01,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:46:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:46:01,097 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:01,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:01,300 INFO L93 Difference]: Finished difference Result 176 states and 214 transitions. [2022-10-15 16:46:01,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:46:01,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2022-10-15 16:46:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:01,303 INFO L225 Difference]: With dead ends: 176 [2022-10-15 16:46:01,303 INFO L226 Difference]: Without dead ends: 176 [2022-10-15 16:46:01,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:46:01,305 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 341 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:01,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 320 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:46:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-10-15 16:46:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 92. [2022-10-15 16:46:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.435897435897436) internal successors, (112), 91 states have internal predecessors, (112), 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:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2022-10-15 16:46:01,314 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 19 [2022-10-15 16:46:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:01,314 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2022-10-15 16:46:01,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-10-15 16:46:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 16:46:01,316 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:01,316 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] [2022-10-15 16:46:01,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:46:01,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:46:01,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:01,317 INFO L85 PathProgramCache]: Analyzing trace with hash -54862344, now seen corresponding path program 1 times [2022-10-15 16:46:01,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:01,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183372275] [2022-10-15 16:46:01,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:01,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:46:01,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:46:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:46:01,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:46:01,387 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:46:01,388 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (27 of 28 remaining) [2022-10-15 16:46:01,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 28 remaining) [2022-10-15 16:46:01,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 28 remaining) [2022-10-15 16:46:01,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 28 remaining) [2022-10-15 16:46:01,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 28 remaining) [2022-10-15 16:46:01,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 28 remaining) [2022-10-15 16:46:01,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 28 remaining) [2022-10-15 16:46:01,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 28 remaining) [2022-10-15 16:46:01,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 28 remaining) [2022-10-15 16:46:01,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 28 remaining) [2022-10-15 16:46:01,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 28 remaining) [2022-10-15 16:46:01,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 28 remaining) [2022-10-15 16:46:01,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 28 remaining) [2022-10-15 16:46:01,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 28 remaining) [2022-10-15 16:46:01,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 28 remaining) [2022-10-15 16:46:01,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 28 remaining) [2022-10-15 16:46:01,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 28 remaining) [2022-10-15 16:46:01,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 28 remaining) [2022-10-15 16:46:01,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 28 remaining) [2022-10-15 16:46:01,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 28 remaining) [2022-10-15 16:46:01,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 28 remaining) [2022-10-15 16:46:01,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 28 remaining) [2022-10-15 16:46:01,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 28 remaining) [2022-10-15 16:46:01,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 28 remaining) [2022-10-15 16:46:01,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 28 remaining) [2022-10-15 16:46:01,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 28 remaining) [2022-10-15 16:46:01,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 28 remaining) [2022-10-15 16:46:01,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (0 of 28 remaining) [2022-10-15 16:46:01,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:46:01,403 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:01,408 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:46:01,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:46:01 BoogieIcfgContainer [2022-10-15 16:46:01,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:46:01,448 INFO L158 Benchmark]: Toolchain (without parser) took 4864.24ms. Allocated memory was 151.0MB in the beginning and 196.1MB in the end (delta: 45.1MB). Free memory was 124.1MB in the beginning and 126.7MB in the end (delta: -2.6MB). Peak memory consumption was 43.3MB. Max. memory is 8.0GB. [2022-10-15 16:46:01,448 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 151.0MB. Free memory was 121.2MB in the beginning and 121.1MB in the end (delta: 82.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:46:01,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.45ms. Allocated memory is still 151.0MB. Free memory was 123.8MB in the beginning and 111.8MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-15 16:46:01,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.90ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 109.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:46:01,450 INFO L158 Benchmark]: Boogie Preprocessor took 104.91ms. Allocated memory is still 151.0MB. Free memory was 109.3MB in the beginning and 107.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:46:01,450 INFO L158 Benchmark]: RCFGBuilder took 836.11ms. Allocated memory is still 151.0MB. Free memory was 107.1MB in the beginning and 117.0MB in the end (delta: -9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 16:46:01,451 INFO L158 Benchmark]: TraceAbstraction took 3273.38ms. Allocated memory was 151.0MB in the beginning and 196.1MB in the end (delta: 45.1MB). Free memory was 116.0MB in the beginning and 126.7MB in the end (delta: -10.7MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. [2022-10-15 16:46:01,453 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 151.0MB. Free memory was 121.2MB in the beginning and 121.1MB in the end (delta: 82.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 507.45ms. Allocated memory is still 151.0MB. Free memory was 123.8MB in the beginning and 111.8MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 124.90ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 109.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 104.91ms. Allocated memory is still 151.0MB. Free memory was 109.3MB in the beginning and 107.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 836.11ms. Allocated memory is still 151.0MB. Free memory was 107.1MB in the beginning and 117.0MB in the end (delta: -9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3273.38ms. Allocated memory was 151.0MB in the beginning and 196.1MB in the end (delta: 45.1MB). Free memory was 116.0MB in the beginning and 126.7MB in the end (delta: -10.7MB). Peak memory consumption was 34.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: 137]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someUnaryDOUBLEoperation at line 16, overapproximation of bitwiseAnd at line 34, overapproximation of memtrack at line 137, overapproximation of bitwiseXOr at line 33, overapproximation of someBinaryArithmeticFLOAToperation at line 37. Possible FailurePath: [L14-L17] static const float one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={4:0}] [L128] float x = 0.0f; [L129] float y = __VERIFIER_nondet_float(); [L131] COND TRUE (y < 0.0f || y > 0.0f) [L133] CALL, EXPR fmod_float(x, y) [L20] __int32_t n, hx, hy, hz, ix, iy, sx, i; VAL [\old(x)=0, \old(y)=4294967308, one_fmod=1, x=0, y=4294967308, Zero_fmod={4:0}] [L23] ieee_float_shape_type gf_u; VAL [\old(x)=0, \old(y)=4294967308, gf_u={6:0}, one_fmod=1, x=0, y=4294967308, Zero_fmod={4:0}] [L24] gf_u.value = (x) VAL [\old(x)=0, \old(y)=4294967308, gf_u={6:0}, one_fmod=1, x=0, y=4294967308, Zero_fmod={4:0}] [L25] EXPR gf_u.word VAL [\old(x)=0, \old(y)=4294967308, gf_u={6:0}, gf_u.word=4294967296, one_fmod=1, x=0, y=4294967308, Zero_fmod={4:0}] [L25] (hx) = gf_u.word [L28] ieee_float_shape_type gf_u; VAL [\old(x)=0, \old(y)=4294967308, gf_u={5:0}, hx=0, one_fmod=1, x=0, y=4294967308, Zero_fmod={4:0}] [L29] gf_u.value = (y) VAL [\old(x)=0, \old(y)=4294967308, gf_u={5:0}, hx=0, one_fmod=1, x=0, y=4294967308, Zero_fmod={4:0}] [L30] EXPR gf_u.word VAL [\old(x)=0, \old(y)=4294967308, gf_u={5:0}, gf_u.word=4294967295, hx=0, one_fmod=1, x=0, y=4294967308, Zero_fmod={4:0}] [L30] (hy) = gf_u.word [L32] sx = hx & 0x80000000 VAL [\old(x)=0, \old(y)=4294967308, hx=0, hy=-1, one_fmod=1, sx=0, x=0, y=4294967308, Zero_fmod={4:0}] [L33] hx ^= sx [L34] hy &= 0x7fffffff VAL [\old(x)=0, \old(y)=4294967308, hx=0, hy=2139095041, one_fmod=1, sx=0, x=0, y=4294967308, Zero_fmod={4:0}] [L36] COND TRUE ((hy) == 0) || !((hx) < 0x7f800000L) || ((hy) > 0x7f800000L) [L37] return (x * y) / (x * y); VAL [\old(x)=0, \old(y)=4294967308, hx=0, hy=2139095041, one_fmod=1, sx=0, x=0, y=4294967308, Zero_fmod={4:0}] [L133] RET, EXPR fmod_float(x, y) [L133] float res = fmod_float(x, y); [L136] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [one_fmod=1, res=4294967307, res == 0.0f && __signbit_float(res) == 0=0, x=0, y=4294967308, Zero_fmod={4:0}] [L136] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L137] reach_error() VAL [one_fmod=1, res=4294967307, x=0, y=4294967308, Zero_fmod={4:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 121]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 558 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 558 mSDsluCounter, 1600 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 830 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 408 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 770 mSDtfsCounter, 408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 7 MinimizatonAttempts, 143 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 476 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:01,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...