/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_0970a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:34,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:34,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:34,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:34,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:34,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:34,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:34,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:34,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:34,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:34,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:34,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:34,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:34,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:34,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:34,476 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:34,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:34,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:34,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:34,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:34,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:34,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:34,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:34,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:34,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:34,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:34,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:34,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:34,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:34,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:34,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:34,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:34,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:34,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:34,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:34,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:34,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:34,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:34,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:34,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:34,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:34,535 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:34,585 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:34,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:34,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:34,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:34,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:34,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:34,590 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:34,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:34,591 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:34,591 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:34,592 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:34,593 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:34,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:34,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:34,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:34,593 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:34,594 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:34,594 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:34,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:34,596 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:34,596 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:34,601 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:34,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:34,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:34,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:34,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:34,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:34,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:34,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:34,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:34,603 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:34,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:35,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:35,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:35,018 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:35,019 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:35,021 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0970a.c [2022-10-15 16:45:35,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de1ef400/bcacdfdf836843a9a63d99d7dc9ca444/FLAGec3dc93f1 [2022-10-15 16:45:35,720 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:35,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0970a.c [2022-10-15 16:45:35,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de1ef400/bcacdfdf836843a9a63d99d7dc9ca444/FLAGec3dc93f1 [2022-10-15 16:45:36,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de1ef400/bcacdfdf836843a9a63d99d7dc9ca444 [2022-10-15 16:45:36,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:36,056 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:36,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:36,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:36,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:36,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:36" (1/1) ... [2022-10-15 16:45:36,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cf07896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:36, skipping insertion in model container [2022-10-15 16:45:36,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:36" (1/1) ... [2022-10-15 16:45:36,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:36,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:36,401 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_0970a.c[4407,4420] [2022-10-15 16:45:36,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:36,415 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:36,459 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_0970a.c[4407,4420] [2022-10-15 16:45:36,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:36,482 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:36,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:36 WrapperNode [2022-10-15 16:45:36,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:36,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:36,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:36,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:36,494 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:36" (1/1) ... [2022-10-15 16:45:36,509 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:36" (1/1) ... [2022-10-15 16:45:36,552 INFO L138 Inliner]: procedures = 19, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 257 [2022-10-15 16:45:36,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:36,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:36,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:36,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:36,566 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:36" (1/1) ... [2022-10-15 16:45:36,566 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:36" (1/1) ... [2022-10-15 16:45:36,574 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:36" (1/1) ... [2022-10-15 16:45:36,574 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:36" (1/1) ... [2022-10-15 16:45:36,588 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:36" (1/1) ... [2022-10-15 16:45:36,596 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:36" (1/1) ... [2022-10-15 16:45:36,598 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:36" (1/1) ... [2022-10-15 16:45:36,601 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:36" (1/1) ... [2022-10-15 16:45:36,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:36,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:36,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:36,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:36,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:36" (1/1) ... [2022-10-15 16:45:36,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:36,658 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:36,667 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:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:36,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:36,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:36,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:36,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:36,830 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:36,833 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:37,410 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:37,419 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:37,419 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-10-15 16:45:37,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:37 BoogieIcfgContainer [2022-10-15 16:45:37,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:37,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:37,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:37,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:37,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:36" (1/3) ... [2022-10-15 16:45:37,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a0f903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:37, skipping insertion in model container [2022-10-15 16:45:37,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:36" (2/3) ... [2022-10-15 16:45:37,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a0f903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:37, skipping insertion in model container [2022-10-15 16:45:37,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:37" (3/3) ... [2022-10-15 16:45:37,433 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0970a.c [2022-10-15 16:45:37,455 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:37,458 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-10-15 16:45:37,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:37,529 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;@2067deb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:37,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-10-15 16:45:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 79 states have (on average 1.8860759493670887) internal successors, (149), 109 states have internal predecessors, (149), 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:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:45:37,543 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:37,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:45:37,544 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash 28693828, now seen corresponding path program 1 times [2022-10-15 16:45:37,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:37,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796656550] [2022-10-15 16:45:37,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:37,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:37,896 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:37,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:37,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796656550] [2022-10-15 16:45:37,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796656550] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:37,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:37,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:37,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017568726] [2022-10-15 16:45:37,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:37,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:37,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:37,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:37,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:37,946 INFO L87 Difference]: Start difference. First operand has 110 states, 79 states have (on average 1.8860759493670887) internal successors, (149), 109 states have internal predecessors, (149), 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:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:38,069 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-10-15 16:45:38,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:38,072 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:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:38,084 INFO L225 Difference]: With dead ends: 108 [2022-10-15 16:45:38,084 INFO L226 Difference]: Without dead ends: 106 [2022-10-15 16:45:38,086 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:38,091 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:38,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 208 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-15 16:45:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-10-15 16:45:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.641025641025641) internal successors, (128), 105 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 128 transitions. [2022-10-15 16:45:38,143 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 128 transitions. Word has length 5 [2022-10-15 16:45:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:38,144 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 128 transitions. [2022-10-15 16:45:38,144 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:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 128 transitions. [2022-10-15 16:45:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:45:38,145 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:38,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:45:38,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:38,146 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:38,147 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2022-10-15 16:45:38,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:38,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191985312] [2022-10-15 16:45:38,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:38,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:38,274 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:38,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:38,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191985312] [2022-10-15 16:45:38,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191985312] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:38,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:38,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:38,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784094106] [2022-10-15 16:45:38,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:38,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:38,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:38,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:38,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:38,280 INFO L87 Difference]: Start difference. First operand 106 states and 128 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:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:38,354 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2022-10-15 16:45:38,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:38,355 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:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:38,357 INFO L225 Difference]: With dead ends: 104 [2022-10-15 16:45:38,357 INFO L226 Difference]: Without dead ends: 104 [2022-10-15 16:45:38,357 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:38,359 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:38,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 213 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-15 16:45:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-10-15 16:45:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 103 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2022-10-15 16:45:38,373 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 5 [2022-10-15 16:45:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:38,374 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2022-10-15 16:45:38,374 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:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2022-10-15 16:45:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:45:38,375 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:38,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:45:38,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:38,376 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash 890247561, now seen corresponding path program 1 times [2022-10-15 16:45:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:38,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347884348] [2022-10-15 16:45:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:38,413 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:38,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:38,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347884348] [2022-10-15 16:45:38,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347884348] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:38,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:38,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:38,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709387040] [2022-10-15 16:45:38,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:38,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:38,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:38,418 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:38,435 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2022-10-15 16:45:38,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:38,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 16:45:38,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:38,437 INFO L225 Difference]: With dead ends: 105 [2022-10-15 16:45:38,438 INFO L226 Difference]: Without dead ends: 105 [2022-10-15 16:45:38,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:38,440 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:38,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-10-15 16:45:38,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-10-15 16:45:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.6075949367088607) internal successors, (127), 104 states have internal predecessors, (127), 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:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2022-10-15 16:45:38,472 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 6 [2022-10-15 16:45:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:38,473 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2022-10-15 16:45:38,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2022-10-15 16:45:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:45:38,477 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:38,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:45:38,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:38,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash 890499719, now seen corresponding path program 1 times [2022-10-15 16:45:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:38,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266635049] [2022-10-15 16:45:38,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:38,543 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:38,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:38,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266635049] [2022-10-15 16:45:38,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266635049] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:38,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:38,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:38,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125786009] [2022-10-15 16:45:38,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:38,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:38,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:38,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:38,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:38,550 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:38,662 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2022-10-15 16:45:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:38,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 16:45:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:38,669 INFO L225 Difference]: With dead ends: 107 [2022-10-15 16:45:38,669 INFO L226 Difference]: Without dead ends: 104 [2022-10-15 16:45:38,670 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:38,674 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:38,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 206 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-15 16:45:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-10-15 16:45:38,696 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:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2022-10-15 16:45:38,700 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 6 [2022-10-15 16:45:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:38,701 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2022-10-15 16:45:38,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-10-15 16:45:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:45:38,702 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:38,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:38,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:38,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash -212149197, now seen corresponding path program 1 times [2022-10-15 16:45:38,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:38,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801574131] [2022-10-15 16:45:38,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:38,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:38,928 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:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:38,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801574131] [2022-10-15 16:45:38,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801574131] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:38,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:38,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757616711] [2022-10-15 16:45:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:38,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:38,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:38,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:38,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:38,931 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:38,994 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2022-10-15 16:45:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:38,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 16:45:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:38,996 INFO L225 Difference]: With dead ends: 102 [2022-10-15 16:45:38,997 INFO L226 Difference]: Without dead ends: 102 [2022-10-15 16:45:38,997 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:39,003 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:39,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-15 16:45:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-10-15 16:45:39,029 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:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-10-15 16:45:39,033 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 13 [2022-10-15 16:45:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:39,033 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-10-15 16:45:39,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-10-15 16:45:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:45:39,034 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:39,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:39,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:39,037 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:39,038 INFO L85 PathProgramCache]: Analyzing trace with hash -212149196, now seen corresponding path program 1 times [2022-10-15 16:45:39,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:39,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54825308] [2022-10-15 16:45:39,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:39,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:39,231 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:39,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:39,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54825308] [2022-10-15 16:45:39,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54825308] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:39,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:39,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:39,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405232325] [2022-10-15 16:45:39,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:39,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:39,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:39,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:39,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:39,237 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:39,298 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2022-10-15 16:45:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:39,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 16:45:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:39,299 INFO L225 Difference]: With dead ends: 100 [2022-10-15 16:45:39,300 INFO L226 Difference]: Without dead ends: 100 [2022-10-15 16:45:39,300 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:39,303 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:39,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-15 16:45:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-10-15 16:45:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 99 states have internal predecessors, (121), 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:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2022-10-15 16:45:39,317 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 13 [2022-10-15 16:45:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:39,317 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2022-10-15 16:45:39,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2022-10-15 16:45:39,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:45:39,319 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:39,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:39,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:45:39,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:39,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash -211897039, now seen corresponding path program 1 times [2022-10-15 16:45:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:39,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648024506] [2022-10-15 16:45:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:39,475 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:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:39,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648024506] [2022-10-15 16:45:39,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648024506] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:39,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:39,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:39,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998596158] [2022-10-15 16:45:39,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:39,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:45:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:39,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:45:39,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:39,478 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:39,568 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2022-10-15 16:45:39,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:45:39,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 16:45:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:39,570 INFO L225 Difference]: With dead ends: 102 [2022-10-15 16:45:39,570 INFO L226 Difference]: Without dead ends: 100 [2022-10-15 16:45:39,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:39,572 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:39,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 269 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-15 16:45:39,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-10-15 16:45:39,581 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:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2022-10-15 16:45:39,582 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 13 [2022-10-15 16:45:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:39,582 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2022-10-15 16:45:39,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2022-10-15 16:45:39,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:45:39,584 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:39,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:39,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:45:39,584 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:39,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash -397344767, now seen corresponding path program 1 times [2022-10-15 16:45:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:39,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067559582] [2022-10-15 16:45:39,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:39,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:45:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:39,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:45:39,730 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:45:39,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (29 of 30 remaining) [2022-10-15 16:45:39,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2022-10-15 16:45:39,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2022-10-15 16:45:39,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2022-10-15 16:45:39,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2022-10-15 16:45:39,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2022-10-15 16:45:39,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2022-10-15 16:45:39,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2022-10-15 16:45:39,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2022-10-15 16:45:39,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2022-10-15 16:45:39,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2022-10-15 16:45:39,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2022-10-15 16:45:39,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2022-10-15 16:45:39,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2022-10-15 16:45:39,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2022-10-15 16:45:39,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2022-10-15 16:45:39,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2022-10-15 16:45:39,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2022-10-15 16:45:39,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2022-10-15 16:45:39,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2022-10-15 16:45:39,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2022-10-15 16:45:39,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2022-10-15 16:45:39,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 30 remaining) [2022-10-15 16:45:39,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2022-10-15 16:45:39,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2022-10-15 16:45:39,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2022-10-15 16:45:39,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2022-10-15 16:45:39,747 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 30 remaining) [2022-10-15 16:45:39,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2022-10-15 16:45:39,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK (0 of 30 remaining) [2022-10-15 16:45:39,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:45:39,765 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:39,771 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:45:39,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:45:39 BoogieIcfgContainer [2022-10-15 16:45:39,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:45:39,848 INFO L158 Benchmark]: Toolchain (without parser) took 3797.11ms. Allocated memory is still 151.0MB. Free memory was 126.1MB in the beginning and 67.3MB in the end (delta: 58.8MB). Peak memory consumption was 59.4MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,849 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:39,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.18ms. Allocated memory is still 151.0MB. Free memory was 125.9MB in the beginning and 113.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.68ms. Allocated memory is still 151.0MB. Free memory was 112.9MB in the beginning and 110.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,850 INFO L158 Benchmark]: Boogie Preprocessor took 53.30ms. Allocated memory is still 151.0MB. Free memory was 110.1MB in the beginning and 107.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,854 INFO L158 Benchmark]: RCFGBuilder took 815.31ms. Allocated memory is still 151.0MB. Free memory was 107.9MB in the beginning and 114.4MB in the end (delta: -6.5MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,854 INFO L158 Benchmark]: TraceAbstraction took 2419.26ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 67.3MB in the end (delta: 46.0MB). Peak memory consumption was 46.6MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,860 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.24ms. Allocated memory is still 151.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 424.18ms. Allocated memory is still 151.0MB. Free memory was 125.9MB in the beginning and 113.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.68ms. Allocated memory is still 151.0MB. Free memory was 112.9MB in the beginning and 110.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.30ms. Allocated memory is still 151.0MB. Free memory was 110.1MB in the beginning and 107.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 815.31ms. Allocated memory is still 151.0MB. Free memory was 107.9MB in the beginning and 114.4MB in the end (delta: -6.5MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2419.26ms. Allocated memory is still 151.0MB. Free memory was 113.3MB in the beginning and 67.3MB in the end (delta: 46.0MB). Peak memory consumption was 46.6MB. 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: 176]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of bitwiseAnd at line 118, overapproximation of memtrack at line 176, overapproximation of someBinaryArithmeticFLOAToperation at line 119. Possible FailurePath: [L14-L18] static const float ln2_hi_log = 6.9313812256e-01, ln2_lo_log = 9.0580006145e-06, two25_log = 3.355443200e+07, Lg1_log = 6.6666668653e-01, Lg2_log = 4.0000000596e-01, Lg3_log = 2.8571429849e-01, Lg4_log = 2.2222198546e-01, Lg5_log = 1.8183572590e-01, Lg6_log = 1.5313838422e-01, Lg7_log = 1.4798198640e-01; [L20] static const float zero_log = 0.0; [L100-L103] static const float two25_log10 = 3.3554432000e+07, ivln10_log10 = 4.3429449201e-01, log10_2hi_log10 = 3.0102920532e-01, log10_2lo_log10 = 7.9034151668e-07; [L105] static const float zero = 0.0; VAL [ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, zero=0, zero_log=0] [L168] float x = __VERIFIER_nondet_float(); [L170] x < 0 && isfinite_float(x) [L170] CALL, EXPR isfinite_float(x) [L151] __int32_t ix; VAL [\old(x)=4294967314, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L153] ieee_float_shape_type gf_u; VAL [\old(x)=4294967314, gf_u={6:0}, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L154] gf_u.value = (x) VAL [\old(x)=4294967314, gf_u={6:0}, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L155] EXPR gf_u.word VAL [\old(x)=4294967314, gf_u={6:0}, gf_u.word=4294967295, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L155] (ix) = gf_u.word [L157] ix &= 0x7fffffff [L158] return (((ix) < 0x7f800000L)); VAL [\old(x)=4294967314, \result=1, ivln10_log10=43429449201/100000000000, ix=1, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L170] RET, EXPR isfinite_float(x) [L170] x < 0 && isfinite_float(x) VAL [isfinite_float(x)=1, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, x < 0 && isfinite_float(x)=1, zero=0, zero_log=0] [L170] COND TRUE x < 0 && isfinite_float(x) [L172] CALL, EXPR __ieee754_log10f(x) [L108] float y, z; [L109] __int32_t i, k, hx; VAL [\old(x)=4294967314, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L112] ieee_float_shape_type gf_u; VAL [\old(x)=4294967314, gf_u={5:0}, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L113] gf_u.value = (x) VAL [\old(x)=4294967314, gf_u={5:0}, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L114] EXPR gf_u.word VAL [\old(x)=4294967314, gf_u={5:0}, gf_u.word=4294967303, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L114] (hx) = gf_u.word [L117] k = 0 VAL [\old(x)=4294967314, hx=7, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L118] COND TRUE ((hx & 0x7fffffff) == 0) [L119] return -two25_log10 / zero; VAL [\old(x)=4294967314, hx=7, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] [L172] RET, EXPR __ieee754_log10f(x) [L172] float res = __ieee754_log10f(x); [L175] CALL, EXPR isnan_float(res) [L147] return x != x; VAL [\old(x)=4294967315, \result=0, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967315, zero=0, zero_log=0] [L175] RET, EXPR isnan_float(res) [L175] COND TRUE !isnan_float(res) [L176] reach_error() VAL [ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, res=4294967315, two25_log=33554432, two25_log10=33554432, x=4294967314, zero=0, zero_log=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 161]: 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, 110 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 1543 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 693 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 293 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 850 mSDtfsCounter, 293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 118 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:45:39,914 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...