/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_1052d.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:44,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:44,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:44,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:44,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:44,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:44,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:44,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:44,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:44,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:44,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:44,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:44,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:44,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:44,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:44,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:44,642 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:44,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:44,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:44,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:44,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:44,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:44,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:44,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:44,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:44,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:44,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:44,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:44,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:44,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:44,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:44,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:44,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:44,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:44,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:44,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:44,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:44,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:44,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:44,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:44,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:44,696 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:44,760 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:44,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:44,761 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:44,761 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:44,763 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:44,764 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:44,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:44,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:44,768 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:44,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:44,769 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:44,769 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:44,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:44,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:44,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:44,770 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:44,771 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:44,771 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:44,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:44,771 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:44,772 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:44,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:44,772 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:44,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:44,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:44,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:44,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:44,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:44,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:44,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:44,774 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:45,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:45,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:45,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:45,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:45,254 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:45,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1052d.c [2022-10-15 16:45:45,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa54a19c/349891967ae744f38ae864961757a213/FLAG0721793d8 [2022-10-15 16:45:45,972 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:45,973 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1052d.c [2022-10-15 16:45:45,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa54a19c/349891967ae744f38ae864961757a213/FLAG0721793d8 [2022-10-15 16:45:46,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fa54a19c/349891967ae744f38ae864961757a213 [2022-10-15 16:45:46,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:46,357 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:46,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:46,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:46,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:46,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:46" (1/1) ... [2022-10-15 16:45:46,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d320e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:46, skipping insertion in model container [2022-10-15 16:45:46,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:46" (1/1) ... [2022-10-15 16:45:46,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:46,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:46,676 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_1052d.c[1740,1753] [2022-10-15 16:45:46,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:46,693 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:46,729 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_1052d.c[1740,1753] [2022-10-15 16:45:46,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:46,748 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:46,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:46 WrapperNode [2022-10-15 16:45:46,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:46,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:46,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:46,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:46,760 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:46" (1/1) ... [2022-10-15 16:45:46,771 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:46" (1/1) ... [2022-10-15 16:45:46,825 INFO L138 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-10-15 16:45:46,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:46,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:46,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:46,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:46,839 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:46" (1/1) ... [2022-10-15 16:45:46,839 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:46" (1/1) ... [2022-10-15 16:45:46,843 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:46" (1/1) ... [2022-10-15 16:45:46,843 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:46" (1/1) ... [2022-10-15 16:45:46,854 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:46" (1/1) ... [2022-10-15 16:45:46,859 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:46" (1/1) ... [2022-10-15 16:45:46,864 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:46" (1/1) ... [2022-10-15 16:45:46,866 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:46" (1/1) ... [2022-10-15 16:45:46,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:46,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:46,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:46,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:46,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:46" (1/1) ... [2022-10-15 16:45:46,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:46,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:46,915 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:46,928 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:46,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:46,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:46,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:46,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:46,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:46,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:46,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:46,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:46,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:46,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:47,096 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:47,099 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:47,654 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:47,671 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:47,671 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-15 16:45:47,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:47 BoogieIcfgContainer [2022-10-15 16:45:47,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:47,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:47,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:47,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:47,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:46" (1/3) ... [2022-10-15 16:45:47,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49301e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:47, skipping insertion in model container [2022-10-15 16:45:47,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:46" (2/3) ... [2022-10-15 16:45:47,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49301e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:47, skipping insertion in model container [2022-10-15 16:45:47,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:47" (3/3) ... [2022-10-15 16:45:47,688 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1052d.c [2022-10-15 16:45:47,710 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:47,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-15 16:45:47,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:47,791 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;@4ed85810, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:47,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-15 16:45:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.837837837837838) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:47,805 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:47,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:47,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:45:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:47,814 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:45:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:47,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869117299] [2022-10-15 16:45:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:48,064 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:48,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:48,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869117299] [2022-10-15 16:45:48,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869117299] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:48,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:48,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:48,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740034952] [2022-10-15 16:45:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:48,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:48,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:48,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:48,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:48,125 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.837837837837838) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:48,240 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-10-15 16:45:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:48,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:45:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:48,253 INFO L225 Difference]: With dead ends: 50 [2022-10-15 16:45:48,254 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 16:45:48,256 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:48,260 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:48,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 91 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 16:45:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-15 16:45:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 47 states have internal predecessors, (57), 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:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-10-15 16:45:48,304 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 4 [2022-10-15 16:45:48,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:48,304 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-10-15 16:45:48,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-10-15 16:45:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:48,306 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:48,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:48,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:48,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:45:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:48,307 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:45:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:48,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004501916] [2022-10-15 16:45:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:48,431 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:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:48,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004501916] [2022-10-15 16:45:48,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004501916] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:48,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:48,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290531677] [2022-10-15 16:45:48,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:48,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:48,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:48,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:48,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:48,436 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:48,472 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-10-15 16:45:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:48,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:45:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:48,474 INFO L225 Difference]: With dead ends: 46 [2022-10-15 16:45:48,475 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 16:45:48,475 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:48,477 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:48,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 91 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:48,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 16:45:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-15 16:45:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 45 states have internal predecessors, (55), 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:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-10-15 16:45:48,486 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 4 [2022-10-15 16:45:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:48,486 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-10-15 16:45:48,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-10-15 16:45:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:45:48,488 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:48,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:48,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:48,489 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:45:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash -671269953, now seen corresponding path program 1 times [2022-10-15 16:45:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:48,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867811544] [2022-10-15 16:45:48,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:48,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:48,640 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:48,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:48,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867811544] [2022-10-15 16:45:48,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867811544] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:48,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:48,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613443607] [2022-10-15 16:45:48,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:48,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:48,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:48,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:48,645 INFO L87 Difference]: Start difference. First operand 46 states and 55 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:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:48,683 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-10-15 16:45:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:48,684 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:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:48,685 INFO L225 Difference]: With dead ends: 44 [2022-10-15 16:45:48,685 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 16:45:48,686 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:48,688 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:48,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 16:45:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-15 16:45:48,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 43 states have internal predecessors, (53), 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:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2022-10-15 16:45:48,697 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 13 [2022-10-15 16:45:48,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:48,698 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2022-10-15 16:45:48,701 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:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2022-10-15 16:45:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:45:48,702 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:48,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:48,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:48,703 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:45:48,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash -671269952, now seen corresponding path program 1 times [2022-10-15 16:45:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:48,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504252012] [2022-10-15 16:45:48,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:48,878 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:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:48,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504252012] [2022-10-15 16:45:48,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504252012] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:48,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:48,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:48,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664940469] [2022-10-15 16:45:48,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:48,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:48,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:48,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:48,882 INFO L87 Difference]: Start difference. First operand 44 states and 53 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:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:48,913 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-10-15 16:45:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:48,914 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:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:48,915 INFO L225 Difference]: With dead ends: 42 [2022-10-15 16:45:48,915 INFO L226 Difference]: Without dead ends: 42 [2022-10-15 16:45:48,916 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:48,918 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:48,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-15 16:45:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-10-15 16:45:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 41 states have internal predecessors, (51), 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:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-10-15 16:45:48,926 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 13 [2022-10-15 16:45:48,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:48,927 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-10-15 16:45:48,927 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:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-10-15 16:45:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:45:48,928 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:48,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:48,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:48,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:45:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1908190708, now seen corresponding path program 1 times [2022-10-15 16:45:48,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:48,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202123412] [2022-10-15 16:45:48,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:49,022 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:49,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:49,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202123412] [2022-10-15 16:45:49,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202123412] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:49,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:49,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978614666] [2022-10-15 16:45:49,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:49,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:49,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:49,027 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:49,062 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-10-15 16:45:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:49,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-10-15 16:45:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:49,064 INFO L225 Difference]: With dead ends: 40 [2022-10-15 16:45:49,064 INFO L226 Difference]: Without dead ends: 40 [2022-10-15 16:45:49,064 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:49,066 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:49,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 75 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-15 16:45:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-10-15 16:45:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 39 states have internal predecessors, (49), 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:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-10-15 16:45:49,074 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 14 [2022-10-15 16:45:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:49,074 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-10-15 16:45:49,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-10-15 16:45:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:45:49,076 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:49,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:49,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:49,077 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:45:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:49,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1908190709, now seen corresponding path program 1 times [2022-10-15 16:45:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:49,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824299978] [2022-10-15 16:45:49,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:49,284 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:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824299978] [2022-10-15 16:45:49,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824299978] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:49,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:49,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377820711] [2022-10-15 16:45:49,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:49,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:49,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:49,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:49,293 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:49,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:49,341 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-10-15 16:45:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:49,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-10-15 16:45:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:49,346 INFO L225 Difference]: With dead ends: 38 [2022-10-15 16:45:49,346 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 16:45:49,346 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:49,350 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:49,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 16:45:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 16:45:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 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:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-10-15 16:45:49,366 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 14 [2022-10-15 16:45:49,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:49,366 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-10-15 16:45:49,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-10-15 16:45:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:45:49,371 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:49,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:49,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:45:49,372 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:45:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1908214668, now seen corresponding path program 1 times [2022-10-15 16:45:49,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:49,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72750374] [2022-10-15 16:45:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:49,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72750374] [2022-10-15 16:45:49,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72750374] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:49,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:49,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:45:49,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018034634] [2022-10-15 16:45:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:49,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:49,445 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:49,456 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-10-15 16:45:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:49,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-10-15 16:45:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:49,458 INFO L225 Difference]: With dead ends: 39 [2022-10-15 16:45:49,458 INFO L226 Difference]: Without dead ends: 39 [2022-10-15 16:45:49,459 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:49,460 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:49,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-15 16:45:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-10-15 16:45:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 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:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-10-15 16:45:49,468 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 14 [2022-10-15 16:45:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:49,468 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-10-15 16:45:49,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-10-15 16:45:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:45:49,470 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:49,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:49,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:45:49,471 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:45:49,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:49,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1908214539, now seen corresponding path program 1 times [2022-10-15 16:45:49,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:49,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040190591] [2022-10-15 16:45:49,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:49,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:49,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:45:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:49,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:45:49,578 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:45:49,579 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2022-10-15 16:45:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2022-10-15 16:45:49,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2022-10-15 16:45:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2022-10-15 16:45:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2022-10-15 16:45:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2022-10-15 16:45:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2022-10-15 16:45:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2022-10-15 16:45:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2022-10-15 16:45:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2022-10-15 16:45:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2022-10-15 16:45:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2022-10-15 16:45:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2022-10-15 16:45:49,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2022-10-15 16:45:49,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:45:49,590 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:49,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:45:49,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:45:49 BoogieIcfgContainer [2022-10-15 16:45:49,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:45:49,629 INFO L158 Benchmark]: Toolchain (without parser) took 3276.54ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 126.0MB in the beginning and 139.0MB in the end (delta: -12.9MB). Peak memory consumption was 18.7MB. Max. memory is 8.0GB. [2022-10-15 16:45:49,629 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 153.1MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:49,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.22ms. Allocated memory is still 153.1MB. Free memory was 125.8MB in the beginning and 115.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:45:49,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.12ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 113.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:49,630 INFO L158 Benchmark]: Boogie Preprocessor took 42.68ms. Allocated memory is still 153.1MB. Free memory was 113.3MB in the beginning and 111.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:45:49,631 INFO L158 Benchmark]: RCFGBuilder took 804.12ms. Allocated memory is still 153.1MB. Free memory was 111.6MB in the beginning and 131.0MB in the end (delta: -19.4MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2022-10-15 16:45:49,631 INFO L158 Benchmark]: TraceAbstraction took 1949.51ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 130.5MB in the beginning and 139.0MB in the end (delta: -8.5MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. [2022-10-15 16:45:49,634 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 153.1MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 385.22ms. Allocated memory is still 153.1MB. Free memory was 125.8MB in the beginning and 115.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.12ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 113.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.68ms. Allocated memory is still 153.1MB. Free memory was 113.3MB in the beginning and 111.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 804.12ms. Allocated memory is still 153.1MB. Free memory was 111.6MB in the beginning and 131.0MB in the end (delta: -19.4MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * TraceAbstraction took 1949.51ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 130.5MB in the beginning and 139.0MB in the end (delta: -8.5MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 82]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of bitwiseAnd at line 23, overapproximation of memtrack at line 82, overapproximation of someBinaryArithmeticFLOAToperation at line 46. Possible FailurePath: [L13] static const float huge_floor = 1.0e30; VAL [huge_floor=1000000000000000000000000000000] [L77] float x = 0.0f; [L78] CALL, EXPR floor_float(x) [L16] __int32_t i0, j0; [L17] __uint32_t i, ix; VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, x=0] [L19] ieee_float_shape_type gf_u; VAL [\old(x)=0, gf_u={5:0}, huge_floor=1000000000000000000000000000000, x=0] [L20] gf_u.value = (x) VAL [\old(x)=0, gf_u={5:0}, huge_floor=1000000000000000000000000000000, x=0] [L21] EXPR gf_u.word VAL [\old(x)=0, gf_u={5:0}, gf_u.word=4294967295, huge_floor=1000000000000000000000000000000, x=0] [L21] (i0) = gf_u.word [L23] ix = (i0 & 0x7fffffff) [L24] j0 = (ix >> 23) - 0x7f VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, i=2139095040, i0=-1, j0=128, x=0] [L25] COND FALSE !(j0 < 23) VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, i=2139095040, i0=-1, j0=128, x=0] [L45] COND TRUE !((ix) < 0x7f800000L) [L46] return x + x; VAL [\old(x)=0, huge_floor=1000000000000000000000000000000, i=2139095040, i0=-1, j0=128, x=0] [L78] RET, EXPR floor_float(x) [L78] float res = floor_float(x); [L81] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [huge_floor=1000000000000000000000000000000, res=1000000000000000000000000000008, res == 0.0f && __signbit_float(res) == 0=0, x=0] [L81] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L82] reach_error() VAL [huge_floor=1000000000000000000000000000000, res=1000000000000000000000000000008, x=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: 70]: 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, 52 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 589 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 336 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 21, 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.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 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:49,690 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...