/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/recursive-simple/sum_10x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:12:57,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:12:57,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:12:57,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:12:57,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:12:57,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:12:57,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:12:57,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:12:57,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:12:57,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:12:57,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:12:57,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:12:57,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:12:57,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:12:57,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:12:57,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:12:57,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:12:57,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:12:57,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:12:57,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:12:57,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:12:57,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:12:57,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:12:57,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:12:57,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:12:57,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:12:57,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:12:57,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:12:57,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:12:57,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:12:57,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:12:57,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:12:57,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:12:57,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:12:57,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:12:57,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:12:57,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:12:57,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:12:57,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:12:57,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:12:57,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:12:57,317 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 17:12:57,353 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:12:57,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:12:57,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:12:57,356 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:12:57,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:12:57,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:12:57,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:12:57,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:12:57,361 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:12:57,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:12:57,363 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:12:57,363 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:12:57,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:12:57,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:12:57,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:12:57,365 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:12:57,365 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:12:57,365 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:12:57,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:12:57,366 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:12:57,366 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:12:57,366 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:12:57,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:12:57,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:12:57,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:12:57,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:12:57,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:12:57,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:12:57,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:12:57,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:12:57,369 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 17:12:57,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:12:57,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:12:57,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:12:57,825 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:12:57,826 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:12:57,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_10x0-2.c [2022-10-15 17:12:57,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ee36201/dc42988d5f0e4eee94035e3960389af7/FLAG1a4e554c1 [2022-10-15 17:12:58,565 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:12:58,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_10x0-2.c [2022-10-15 17:12:58,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ee36201/dc42988d5f0e4eee94035e3960389af7/FLAG1a4e554c1 [2022-10-15 17:12:58,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ee36201/dc42988d5f0e4eee94035e3960389af7 [2022-10-15 17:12:58,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:12:58,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:12:58,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:12:58,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:12:58,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:12:58,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:12:58" (1/1) ... [2022-10-15 17:12:58,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55df7c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:58, skipping insertion in model container [2022-10-15 17:12:58,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:12:58" (1/1) ... [2022-10-15 17:12:58,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:12:58,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:12:59,139 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/recursive-simple/sum_10x0-2.c[481,494] [2022-10-15 17:12:59,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:12:59,155 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:12:59,174 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/recursive-simple/sum_10x0-2.c[481,494] [2022-10-15 17:12:59,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:12:59,194 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:12:59,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59 WrapperNode [2022-10-15 17:12:59,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:12:59,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:12:59,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:12:59,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:12:59,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,238 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-10-15 17:12:59,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:12:59,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:12:59,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:12:59,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:12:59,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,260 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:12:59,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:12:59,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:12:59,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:12:59,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (1/1) ... [2022-10-15 17:12:59,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:12:59,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:59,308 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 17:12:59,325 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 17:12:59,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:12:59,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:12:59,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:12:59,401 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2022-10-15 17:12:59,401 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2022-10-15 17:12:59,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:12:59,502 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:12:59,505 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:12:59,679 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:12:59,691 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:12:59,691 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 17:12:59,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:12:59 BoogieIcfgContainer [2022-10-15 17:12:59,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:12:59,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:12:59,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:12:59,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:12:59,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:12:58" (1/3) ... [2022-10-15 17:12:59,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a982462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:12:59, skipping insertion in model container [2022-10-15 17:12:59,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:59" (2/3) ... [2022-10-15 17:12:59,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a982462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:12:59, skipping insertion in model container [2022-10-15 17:12:59,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:12:59" (3/3) ... [2022-10-15 17:12:59,711 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0-2.c [2022-10-15 17:12:59,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:12:59,736 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 17:12:59,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:12:59,826 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;@1c346852, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:12:59,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 17:12:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:12:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:12:59,847 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:59,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:59,849 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1993088021, now seen corresponding path program 1 times [2022-10-15 17:12:59,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:59,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142935840] [2022-10-15 17:12:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:00,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:00,340 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 17:13:00,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:13:00,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142935840] [2022-10-15 17:13:00,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142935840] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:13:00,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:13:00,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:13:00,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744602045] [2022-10-15 17:13:00,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:13:00,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:13:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:13:00,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:13:00,389 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:13:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:00,457 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-10-15 17:13:00,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:13:00,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-15 17:13:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:00,471 INFO L225 Difference]: With dead ends: 19 [2022-10-15 17:13:00,471 INFO L226 Difference]: Without dead ends: 17 [2022-10-15 17:13:00,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:13:00,480 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:00,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 32 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:13:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-10-15 17:13:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-10-15 17:13:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 17:13:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-10-15 17:13:00,534 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2022-10-15 17:13:00,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:00,534 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-10-15 17:13:00,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:13:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-10-15 17:13:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 17:13:00,537 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:00,537 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:00,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:13:00,538 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:00,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1131436075, now seen corresponding path program 1 times [2022-10-15 17:13:00,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:00,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206699035] [2022-10-15 17:13:00,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:00,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:00,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:13:00,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:13:00,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206699035] [2022-10-15 17:13:00,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206699035] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:13:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048813345] [2022-10-15 17:13:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:00,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:00,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:13:00,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:13:00,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:13:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:01,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 17:13:01,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:13:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:13:01,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:13:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:13:01,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048813345] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:13:01,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:13:01,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2022-10-15 17:13:01,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354422301] [2022-10-15 17:13:01,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:13:01,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 17:13:01,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:01,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 17:13:01,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:13:01,355 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 17:13:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:01,446 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-10-15 17:13:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:13:01,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2022-10-15 17:13:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:01,448 INFO L225 Difference]: With dead ends: 20 [2022-10-15 17:13:01,448 INFO L226 Difference]: Without dead ends: 20 [2022-10-15 17:13:01,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:13:01,452 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:01,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 42 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:13:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-10-15 17:13:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-10-15 17:13:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 17:13:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-10-15 17:13:01,460 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2022-10-15 17:13:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:01,461 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-10-15 17:13:01,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 17:13:01,461 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-10-15 17:13:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:13:01,463 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:01,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:01,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:13:01,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:01,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:01,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1751953557, now seen corresponding path program 2 times [2022-10-15 17:13:01,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:01,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758772482] [2022-10-15 17:13:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:01,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:01,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:01,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 17:13:01,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:13:01,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758772482] [2022-10-15 17:13:01,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758772482] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:13:01,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998825971] [2022-10-15 17:13:01,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:13:01,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:01,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:13:01,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:13:02,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:13:02,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:13:02,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:13:02,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 17:13:02,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:13:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 17:13:02,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:13:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 17:13:02,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998825971] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:13:02,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:13:02,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2022-10-15 17:13:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100050103] [2022-10-15 17:13:02,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:13:02,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 17:13:02,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:02,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 17:13:02,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:13:02,569 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-10-15 17:13:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:02,642 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-10-15 17:13:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:13:02,643 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2022-10-15 17:13:02,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:02,644 INFO L225 Difference]: With dead ends: 23 [2022-10-15 17:13:02,644 INFO L226 Difference]: Without dead ends: 23 [2022-10-15 17:13:02,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-10-15 17:13:02,646 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:02,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 55 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:13:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-10-15 17:13:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-10-15 17:13:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 17:13:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-10-15 17:13:02,653 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2022-10-15 17:13:02,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:02,654 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-10-15 17:13:02,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-10-15 17:13:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-10-15 17:13:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 17:13:02,655 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:02,656 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:02,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 17:13:02,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-10-15 17:13:02,871 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:02,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1658754005, now seen corresponding path program 3 times [2022-10-15 17:13:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:02,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671068080] [2022-10-15 17:13:02,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:02,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:03,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:03,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:03,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 17:13:03,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:13:03,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671068080] [2022-10-15 17:13:03,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671068080] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:13:03,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375383859] [2022-10-15 17:13:03,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 17:13:03,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:03,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:13:03,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:13:03,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:13:03,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-15 17:13:03,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:13:03,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 17:13:03,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:13:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 17:13:03,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:13:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 17:13:03,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375383859] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:13:03,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:13:03,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2022-10-15 17:13:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144518946] [2022-10-15 17:13:03,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:13:03,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 17:13:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:03,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 17:13:03,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-10-15 17:13:03,923 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2022-10-15 17:13:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:04,013 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-10-15 17:13:04,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:13:04,013 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 28 [2022-10-15 17:13:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:04,015 INFO L225 Difference]: With dead ends: 26 [2022-10-15 17:13:04,015 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 17:13:04,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-10-15 17:13:04,017 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 58 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:04,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 52 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:13:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 17:13:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-15 17:13:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 17:13:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-10-15 17:13:04,024 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 28 [2022-10-15 17:13:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:04,025 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-10-15 17:13:04,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2022-10-15 17:13:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-10-15 17:13:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 17:13:04,027 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:04,027 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:04,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:13:04,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:04,241 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash 12143339, now seen corresponding path program 4 times [2022-10-15 17:13:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:04,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780907747] [2022-10-15 17:13:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:04,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:04,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:04,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-15 17:13:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:13:04,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780907747] [2022-10-15 17:13:04,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780907747] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:13:04,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581380798] [2022-10-15 17:13:04,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-15 17:13:04,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:04,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:13:04,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:13:04,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:13:04,738 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-15 17:13:04,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:13:04,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 17:13:04,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:13:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-15 17:13:04,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:13:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 17:13:05,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581380798] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:13:05,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:13:05,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2022-10-15 17:13:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490691794] [2022-10-15 17:13:05,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:13:05,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-15 17:13:05,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:05,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-15 17:13:05,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:13:05,562 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2022-10-15 17:13:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:05,649 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-10-15 17:13:05,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:13:05,650 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) Word has length 34 [2022-10-15 17:13:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:05,651 INFO L225 Difference]: With dead ends: 29 [2022-10-15 17:13:05,651 INFO L226 Difference]: Without dead ends: 29 [2022-10-15 17:13:05,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-10-15 17:13:05,653 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:05,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 54 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:13:05,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-10-15 17:13:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-10-15 17:13:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-15 17:13:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-10-15 17:13:05,660 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 34 [2022-10-15 17:13:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:05,660 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-10-15 17:13:05,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2022-10-15 17:13:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-10-15 17:13:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 17:13:05,662 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:05,662 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:05,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:13:05,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:05,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1060261931, now seen corresponding path program 5 times [2022-10-15 17:13:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:05,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463218477] [2022-10-15 17:13:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:05,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:06,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:06,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:06,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:06,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:06,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-10-15 17:13:06,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:13:06,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463218477] [2022-10-15 17:13:06,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463218477] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:13:06,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640984528] [2022-10-15 17:13:06,372 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-15 17:13:06,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:06,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:13:06,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:13:06,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 17:13:06,440 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-10-15 17:13:06,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:13:06,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-15 17:13:06,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:13:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-10-15 17:13:06,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:13:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 17:13:07,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640984528] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:13:07,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:13:07,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2022-10-15 17:13:07,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811233000] [2022-10-15 17:13:07,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:13:07,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 17:13:07,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:07,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 17:13:07,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-10-15 17:13:07,632 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2022-10-15 17:13:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:07,722 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-10-15 17:13:07,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:13:07,722 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) Word has length 40 [2022-10-15 17:13:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:07,724 INFO L225 Difference]: With dead ends: 32 [2022-10-15 17:13:07,724 INFO L226 Difference]: Without dead ends: 32 [2022-10-15 17:13:07,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2022-10-15 17:13:07,726 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:07,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 56 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:13:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-15 17:13:07,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-10-15 17:13:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-15 17:13:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-10-15 17:13:07,733 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 40 [2022-10-15 17:13:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:07,734 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-10-15 17:13:07,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2022-10-15 17:13:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-10-15 17:13:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-15 17:13:07,736 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:07,736 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:07,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 17:13:07,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:07,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash 456250987, now seen corresponding path program 6 times [2022-10-15 17:13:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:07,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924170033] [2022-10-15 17:13:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:07,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:08,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:08,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:08,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:08,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:08,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-10-15 17:13:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:13:08,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924170033] [2022-10-15 17:13:08,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924170033] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:13:08,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897207220] [2022-10-15 17:13:08,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-15 17:13:08,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:08,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:13:08,465 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:13:08,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 17:13:08,564 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-10-15 17:13:08,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:13:08,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-15 17:13:08,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:13:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-10-15 17:13:08,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:13:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 17:13:10,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897207220] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:13:10,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:13:10,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2022-10-15 17:13:10,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156037893] [2022-10-15 17:13:10,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:13:10,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-15 17:13:10,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:10,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-15 17:13:10,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-10-15 17:13:10,482 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2022-10-15 17:13:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:10,622 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-10-15 17:13:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 17:13:10,623 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) Word has length 46 [2022-10-15 17:13:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:10,625 INFO L225 Difference]: With dead ends: 35 [2022-10-15 17:13:10,625 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 17:13:10,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2022-10-15 17:13:10,627 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 99 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:10,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 77 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:13:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 17:13:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-10-15 17:13:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-15 17:13:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-10-15 17:13:10,634 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 46 [2022-10-15 17:13:10,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:10,635 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-10-15 17:13:10,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2022-10-15 17:13:10,636 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-10-15 17:13:10,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-15 17:13:10,637 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:10,637 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:10,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 17:13:10,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:10,851 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash 556858325, now seen corresponding path program 7 times [2022-10-15 17:13:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:10,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760099586] [2022-10-15 17:13:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:10,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:11,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:11,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:11,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:11,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:11,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:11,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-10-15 17:13:11,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:13:11,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760099586] [2022-10-15 17:13:11,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760099586] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:13:11,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071810273] [2022-10-15 17:13:11,495 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-15 17:13:11,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:11,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:13:11,500 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:13:11,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 17:13:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:11,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-15 17:13:11,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:13:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-10-15 17:13:11,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:13:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-15 17:13:13,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071810273] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:13:13,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:13:13,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2022-10-15 17:13:13,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279582687] [2022-10-15 17:13:13,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:13:13,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-15 17:13:13,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:13,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-15 17:13:13,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-10-15 17:13:13,817 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-10-15 17:13:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:13,950 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-10-15 17:13:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 17:13:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2022-10-15 17:13:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:13,954 INFO L225 Difference]: With dead ends: 38 [2022-10-15 17:13:13,954 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:13:13,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=587, Unknown=0, NotChecked=0, Total=870 [2022-10-15 17:13:13,956 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:13,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 89 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:13:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:13:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 17:13:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2022-10-15 17:13:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2022-10-15 17:13:13,979 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 52 [2022-10-15 17:13:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:13,980 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2022-10-15 17:13:13,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-10-15 17:13:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-10-15 17:13:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 17:13:13,984 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:13,984 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:14,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 17:13:14,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:14,200 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:14,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1351152107, now seen corresponding path program 8 times [2022-10-15 17:13:14,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:14,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417732570] [2022-10-15 17:13:14,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:14,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:14,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:14,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:14,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:14,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:14,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-10-15 17:13:14,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:13:14,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417732570] [2022-10-15 17:13:14,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417732570] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:13:14,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450699209] [2022-10-15 17:13:14,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:13:14,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:14,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:13:14,881 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:13:14,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 17:13:14,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:13:14,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:13:14,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-15 17:13:14,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:13:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-10-15 17:13:15,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:13:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-10-15 17:13:17,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450699209] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:13:17,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:13:17,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2022-10-15 17:13:17,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996294172] [2022-10-15 17:13:17,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:13:17,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-15 17:13:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:17,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-15 17:13:17,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2022-10-15 17:13:17,909 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-10-15 17:13:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:18,066 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-10-15 17:13:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:13:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 58 [2022-10-15 17:13:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:18,067 INFO L225 Difference]: With dead ends: 41 [2022-10-15 17:13:18,068 INFO L226 Difference]: Without dead ends: 41 [2022-10-15 17:13:18,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 113 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=344, Invalid=712, Unknown=0, NotChecked=0, Total=1056 [2022-10-15 17:13:18,069 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 105 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:18,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 81 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:13:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-15 17:13:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-10-15 17:13:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 29 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 17:13:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-10-15 17:13:18,075 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 58 [2022-10-15 17:13:18,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:18,076 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-10-15 17:13:18,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-10-15 17:13:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-10-15 17:13:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-10-15 17:13:18,077 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:18,078 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:18,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 17:13:18,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-10-15 17:13:18,292 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:18,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1948485675, now seen corresponding path program 9 times [2022-10-15 17:13:18,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:18,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140192695] [2022-10-15 17:13:18,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:18,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:18,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:18,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:18,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:19,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:19,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:19,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:13:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:13:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-10-15 17:13:19,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:13:19,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140192695] [2022-10-15 17:13:19,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140192695] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:13:19,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186224197] [2022-10-15 17:13:19,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 17:13:19,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:19,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:13:19,197 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:13:19,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 17:13:19,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-10-15 17:13:19,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:13:19,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2022-10-15 17:13:19,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:13:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-10-15 17:13:19,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:13:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-15 17:13:23,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186224197] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:13:23,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:13:23,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2022-10-15 17:13:23,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576989523] [2022-10-15 17:13:23,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:13:23,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-15 17:13:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:23,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-15 17:13:23,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-10-15 17:13:23,261 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2022-10-15 17:13:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:23,381 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-10-15 17:13:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 17:13:23,381 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) Word has length 64 [2022-10-15 17:13:23,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:23,383 INFO L225 Difference]: With dead ends: 44 [2022-10-15 17:13:23,383 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 17:13:23,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 125 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=408, Invalid=782, Unknown=0, NotChecked=0, Total=1190 [2022-10-15 17:13:23,384 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 72 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:23,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 84 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:13:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 17:13:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-15 17:13:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 31 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-15 17:13:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2022-10-15 17:13:23,390 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 64 [2022-10-15 17:13:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:23,391 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2022-10-15 17:13:23,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 12 states have call successors, (12), 1 states have call predecessors, (12), 10 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2022-10-15 17:13:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-10-15 17:13:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-15 17:13:23,392 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:23,392 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:23,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 17:13:23,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-15 17:13:23,607 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:23,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:23,608 INFO L85 PathProgramCache]: Analyzing trace with hash -582312597, now seen corresponding path program 10 times [2022-10-15 17:13:23,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:23,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252726755] [2022-10-15 17:13:23,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:13:23,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:13:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:13:23,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:13:23,684 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:13:23,686 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 17:13:23,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 17:13:23,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:13:23,692 INFO L444 BasicCegarLoop]: Path program histogram: [10, 1] [2022-10-15 17:13:23,697 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:13:23,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:13:23 BoogieIcfgContainer [2022-10-15 17:13:23,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:13:23,743 INFO L158 Benchmark]: Toolchain (without parser) took 24804.66ms. Allocated memory was 153.1MB in the beginning and 320.9MB in the end (delta: 167.8MB). Free memory was 127.6MB in the beginning and 229.8MB in the end (delta: -102.2MB). Peak memory consumption was 66.2MB. Max. memory is 8.0GB. [2022-10-15 17:13:23,743 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 153.1MB. Free memory was 123.6MB in the beginning and 123.5MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:13:23,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.49ms. Allocated memory is still 153.1MB. Free memory was 127.3MB in the beginning and 117.9MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 17:13:23,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.90ms. Allocated memory is still 153.1MB. Free memory was 117.9MB in the beginning and 116.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:13:23,744 INFO L158 Benchmark]: Boogie Preprocessor took 22.92ms. Allocated memory is still 153.1MB. Free memory was 116.4MB in the beginning and 115.5MB in the end (delta: 916.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:13:23,745 INFO L158 Benchmark]: RCFGBuilder took 430.30ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 106.5MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 17:13:23,745 INFO L158 Benchmark]: TraceAbstraction took 24041.12ms. Allocated memory was 153.1MB in the beginning and 320.9MB in the end (delta: 167.8MB). Free memory was 105.8MB in the beginning and 229.8MB in the end (delta: -123.9MB). Peak memory consumption was 45.3MB. Max. memory is 8.0GB. [2022-10-15 17:13:23,747 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.30ms. Allocated memory is still 153.1MB. Free memory was 123.6MB in the beginning and 123.5MB in the end (delta: 76.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.49ms. Allocated memory is still 153.1MB. Free memory was 127.3MB in the beginning and 117.9MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.90ms. Allocated memory is still 153.1MB. Free memory was 117.9MB in the beginning and 116.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.92ms. Allocated memory is still 153.1MB. Free memory was 116.4MB in the beginning and 115.5MB in the end (delta: 916.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 430.30ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 106.5MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 24041.12ms. Allocated memory was 153.1MB in the beginning and 320.9MB in the end (delta: 167.8MB). Free memory was 105.8MB in the beginning and 229.8MB in the end (delta: -123.9MB). Peak memory consumption was 45.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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L14] int a = 10; [L15] int b = 0; VAL [a=10, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10, m=10, n=0] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10, sum(n - 1, m + 1)=10] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=10, b=0, sum(a, b)=10] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b VAL [a=10, b=0, result=10] [L18] reach_error() VAL [a=10, b=0, result=10] - UnprovableResult [Line: 13]: 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 2 procedures, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 618 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 622 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 520 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 102 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 952 GetRequests, 696 SyntacticMatches, 55 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=10, InterpolantAutomatonStates: 95, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 800 NumberOfCodeBlocks, 794 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1062 ConstructedInterpolants, 0 QuantifiedInterpolants, 3041 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1244 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 1065/2700 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 17:13:23,811 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...