/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-benchs/sqrt_poly2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:42:51,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:42:51,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:42:51,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:42:51,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:42:51,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:42:51,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:42:51,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:42:51,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:42:51,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:42:51,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:42:51,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:42:51,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:42:51,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:42:51,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:42:51,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:42:51,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:42:51,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:42:51,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:42:51,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:42:51,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:42:51,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:42:51,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:42:51,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:42:51,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:42:51,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:42:51,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:42:51,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:42:51,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:42:51,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:42:51,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:42:51,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:42:51,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:42:51,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:42:51,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:42:51,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:42:51,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:42:51,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:42:51,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:42:51,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:42:51,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:42:51,712 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:42:51,743 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:42:51,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:42:51,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:42:51,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:42:51,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:42:51,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:42:51,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:42:51,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:42:51,746 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:42:51,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:42:51,747 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:42:51,747 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:42:51,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:42:51,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:42:51,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:42:51,748 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:42:51,748 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:42:51,748 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:42:51,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:42:51,748 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:42:51,749 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:42:51,749 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:42:51,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:42:51,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:42:51,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:42:51,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:42:51,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:42:51,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:42:51,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:42:51,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:42:51,751 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:42:52,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:42:52,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:42:52,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:42:52,144 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:42:52,145 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:42:52,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_poly2.c [2022-10-15 16:42:52,225 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62efe6094/742483fa638c4d0ba90e00e3630e84a4/FLAG69ecbce74 [2022-10-15 16:42:52,894 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:42:52,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly2.c [2022-10-15 16:42:52,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62efe6094/742483fa638c4d0ba90e00e3630e84a4/FLAG69ecbce74 [2022-10-15 16:42:53,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62efe6094/742483fa638c4d0ba90e00e3630e84a4 [2022-10-15 16:42:53,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:42:53,313 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:42:53,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:42:53,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:42:53,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:42:53,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ccf7447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53, skipping insertion in model container [2022-10-15 16:42:53,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:42:53,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:42:53,586 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-benchs/sqrt_poly2.c[587,600] [2022-10-15 16:42:53,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:42:53,620 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:42:53,635 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-benchs/sqrt_poly2.c[587,600] [2022-10-15 16:42:53,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:42:53,662 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:42:53,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53 WrapperNode [2022-10-15 16:42:53,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:42:53,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:42:53,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:42:53,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:42:53,673 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:42:53" (1/1) ... [2022-10-15 16:42:53,683 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:42:53" (1/1) ... [2022-10-15 16:42:53,716 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2022-10-15 16:42:53,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:42:53,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:42:53,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:42:53,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:42:53,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,743 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:42:53,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:42:53,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:42:53,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:42:53,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53" (1/1) ... [2022-10-15 16:42:53,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:42:53,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:42:53,787 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:42:53,800 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:42:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:42:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:42:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:42:53,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:42:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:42:53,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:42:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:42:53,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:42:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:42:53,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:42:53,987 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:42:53,989 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:42:54,305 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:42:54,334 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:42:54,335 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 16:42:54,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:42:54 BoogieIcfgContainer [2022-10-15 16:42:54,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:42:54,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:42:54,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:42:54,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:42:54,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:42:53" (1/3) ... [2022-10-15 16:42:54,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49908303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:42:54, skipping insertion in model container [2022-10-15 16:42:54,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:42:53" (2/3) ... [2022-10-15 16:42:54,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49908303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:42:54, skipping insertion in model container [2022-10-15 16:42:54,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:42:54" (3/3) ... [2022-10-15 16:42:54,350 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_poly2.c [2022-10-15 16:42:54,379 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:42:54,380 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-15 16:42:54,487 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:42:54,500 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;@13cc9050, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:42:54,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-15 16:42:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 38 states have internal predecessors, (41), 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:42:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:42:54,517 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:54,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:42:54,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:42:54,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash 28693828, now seen corresponding path program 1 times [2022-10-15 16:42:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:54,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670751864] [2022-10-15 16:42:54,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:54,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:54,775 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:42:54,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:54,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670751864] [2022-10-15 16:42:54,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670751864] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:54,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:54,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:42:54,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186713425] [2022-10-15 16:42:54,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:54,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-15 16:42:54,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:54,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-15 16:42:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 16:42:54,835 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 38 states have internal predecessors, (41), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:42:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:54,854 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-10-15 16:42:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-15 16:42:54,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:42:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:54,866 INFO L225 Difference]: With dead ends: 39 [2022-10-15 16:42:54,866 INFO L226 Difference]: Without dead ends: 37 [2022-10-15 16:42:54,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 16:42:54,875 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:54,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-10-15 16:42:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-10-15 16:42:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 36 states have internal predecessors, (37), 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:42:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-10-15 16:42:54,919 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 5 [2022-10-15 16:42:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:54,920 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-10-15 16:42:54,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:42:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-10-15 16:42:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:42:54,921 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:54,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:42:54,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:42:54,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:42:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash 28695750, now seen corresponding path program 1 times [2022-10-15 16:42:54,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:54,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076951428] [2022-10-15 16:42:54,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:54,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:55,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:42:55,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:55,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076951428] [2022-10-15 16:42:55,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076951428] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:55,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:55,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:42:55,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547603107] [2022-10-15 16:42:55,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:55,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:55,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:55,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:55,026 INFO L87 Difference]: Start difference. First operand 37 states and 37 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:42:55,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:55,075 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-10-15 16:42:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:55,076 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:42:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:55,077 INFO L225 Difference]: With dead ends: 30 [2022-10-15 16:42:55,077 INFO L226 Difference]: Without dead ends: 30 [2022-10-15 16:42:55,078 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:42:55,080 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:55,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 21 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-15 16:42:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-15 16:42:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:42:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-10-15 16:42:55,086 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 5 [2022-10-15 16:42:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:55,086 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-10-15 16:42:55,087 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:42:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-10-15 16:42:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:42:55,087 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:55,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:42:55,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:42:55,088 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:42:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:55,091 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2022-10-15 16:42:55,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:55,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569532201] [2022-10-15 16:42:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:42:55,286 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:42:55,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:42:55,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569532201] [2022-10-15 16:42:55,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569532201] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:42:55,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:42:55,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:42:55,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779495315] [2022-10-15 16:42:55,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:42:55,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:42:55,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:42:55,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:42:55,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:42:55,290 INFO L87 Difference]: Start difference. First operand 30 states and 30 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:42:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:42:55,320 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-10-15 16:42:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:42:55,321 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:42:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:42:55,322 INFO L225 Difference]: With dead ends: 23 [2022-10-15 16:42:55,322 INFO L226 Difference]: Without dead ends: 23 [2022-10-15 16:42:55,322 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:42:55,324 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:42:55,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:42:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-10-15 16:42:55,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-10-15 16:42:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 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:42:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-10-15 16:42:55,330 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 5 [2022-10-15 16:42:55,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:42:55,330 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-10-15 16:42:55,330 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:42:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-10-15 16:42:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:42:55,331 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:42:55,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:42:55,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:42:55,332 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:42:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:42:55,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1105652216, now seen corresponding path program 1 times [2022-10-15 16:42:55,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:42:55,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454878081] [2022-10-15 16:42:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:42:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:42:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:42:55,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:42:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:42:55,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:42:55,525 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:42:55,527 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-10-15 16:42:55,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2022-10-15 16:42:55,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-10-15 16:42:55,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-10-15 16:42:55,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-10-15 16:42:55,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-10-15 16:42:55,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-10-15 16:42:55,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-10-15 16:42:55,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-10-15 16:42:55,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-10-15 16:42:55,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2022-10-15 16:42:55,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2022-10-15 16:42:55,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2022-10-15 16:42:55,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2022-10-15 16:42:55,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2022-10-15 16:42:55,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-10-15 16:42:55,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:42:55,546 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-10-15 16:42:55,551 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:42:55,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:42:55 BoogieIcfgContainer [2022-10-15 16:42:55,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:42:55,597 INFO L158 Benchmark]: Toolchain (without parser) took 2289.92ms. Allocated memory is still 151.0MB. Free memory was 124.6MB in the beginning and 82.2MB in the end (delta: 42.4MB). Peak memory consumption was 43.6MB. Max. memory is 8.0GB. [2022-10-15 16:42:55,598 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:42:55,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.64ms. Allocated memory is still 151.0MB. Free memory was 124.4MB in the beginning and 113.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:42:55,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.02ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 112.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:42:55,600 INFO L158 Benchmark]: Boogie Preprocessor took 29.99ms. Allocated memory is still 151.0MB. Free memory was 112.2MB in the beginning and 110.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:42:55,600 INFO L158 Benchmark]: RCFGBuilder took 589.14ms. Allocated memory is still 151.0MB. Free memory was 110.8MB in the beginning and 132.2MB in the end (delta: -21.4MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. [2022-10-15 16:42:55,601 INFO L158 Benchmark]: TraceAbstraction took 1255.14ms. Allocated memory is still 151.0MB. Free memory was 131.5MB in the beginning and 82.2MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-10-15 16:42:55,604 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.21ms. Allocated memory is still 151.0MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 344.64ms. Allocated memory is still 151.0MB. Free memory was 124.4MB in the beginning and 113.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.02ms. Allocated memory is still 151.0MB. Free memory was 113.9MB in the beginning and 112.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.99ms. Allocated memory is still 151.0MB. Free memory was 112.2MB in the beginning and 110.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 589.14ms. Allocated memory is still 151.0MB. Free memory was 110.8MB in the beginning and 132.2MB in the end (delta: -21.4MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1255.14ms. Allocated memory is still 151.0MB. Free memory was 131.5MB in the beginning and 82.2MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 14]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseOr at line 38, overapproximation of someUnaryDOUBLEoperation at line 20, overapproximation of bitwiseAnd at line 37, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51, overapproximation of memtrack at line 14, overapproximation of someBinaryDOUBLEComparisonOperation at line 65. Possible FailurePath: [L17] double C0 = 1.414213538; [L18] double C1 = 0.229761391; [L19] double C2 = 1.296735525; [L20] double C3 = -0.901098370; [L21] double C4 = 0.493553400; [L22] double C5 = -0.118958666; VAL [C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000] [L58] double x,y; [L60] x = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not(x >= 1. && x <= 1e10) [L12] COND FALSE !(!cond) VAL [\old(cond)=1, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, cond=1] [L61] RET assume_abort_if_not(x >= 1. && x <= 1e10) [L63] CALL, EXPR sqrt_custom(x) [L31] union u x; [L32] double r; [L33] int exp; VAL [\old(a)=4294967306, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, x={4:0}] [L35] x.d = a VAL [\old(a)=4294967306, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, x={4:0}] [L37] EXPR x.i[0] VAL [\old(a)=4294967306, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, x={4:0}, x.i[0]=4294967296] [L37] exp = (x.i[0] & 0x7FF00000) >> 20 [L38] EXPR x.i[0] VAL [\old(a)=4294967306, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, exp=1, x={4:0}, x.i[0]=4294967296] [L38] x.i[0] = (x.i[0] & 0x800FFFFF) | 0x3FF00000 VAL [\old(a)=4294967306, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, exp=1, x={4:0}, x.i[0]=4294967296] [L39] EXPR x.d VAL [\old(a)=4294967306, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, exp=1, x={4:0}, x.d=4294967305] [L39] r = x.d * 0.5 [L41] r = C1+C2+(C3+(C4+C5*r)*r)*r VAL [\old(a)=4294967306, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, exp=1, x={4:0}] [L43] COND FALSE !(exp % 2 == 0) [L47] r = r * C0 VAL [\old(a)=4294967306, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, exp=1, x={4:0}] [L50] x.i[0] = (exp/2 + 511) << 20 VAL [\old(a)=4294967306, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, exp=1, x={4:0}] [L51] EXPR x.d VAL [\old(a)=4294967306, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, exp=1, x={4:0}, x.d=4294967304] [L51] r = r * x.d [L53] return r; [L53] return r; VAL [\old(a)=4294967306, \result=4294967307, a=4294967306, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, exp=1, r=4294967307] [L63] RET, EXPR sqrt_custom(x) [L63] y = sqrt_custom(x) [L65] CALL __VERIFIER_assert(y >= 0. && y <= 1e6) [L14] COND TRUE !(cond) VAL [\old(cond)=0, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, cond=0] [L14] reach_error() VAL [\old(cond)=0, C0=707106769/500000000, C1=229761391/1000000000, C2=51869421/40000000, C4=2467767/5000000, cond=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: 56]: 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, 39 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 69 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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:42:55,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...