/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/id_i25_o25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:12:40,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:12:40,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:12:40,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:12:40,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:12:40,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:12:40,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:12:40,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:12:40,515 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:12:40,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:12:40,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:12:40,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:12:40,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:12:40,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:12:40,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:12:40,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:12:40,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:12:40,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:12:40,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:12:40,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:12:40,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:12:40,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:12:40,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:12:40,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:12:40,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:12:40,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:12:40,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:12:40,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:12:40,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:12:40,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:12:40,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:12:40,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:12:40,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:12:40,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:12:40,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:12:40,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:12:40,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:12:40,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:12:40,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:12:40,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:12:40,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:12:40,581 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:40,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:12:40,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:12:40,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:12:40,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:12:40,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:12:40,616 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:12:40,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:12:40,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:12:40,618 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:12:40,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:12:40,618 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:12:40,618 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:12:40,619 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:12:40,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:12:40,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:12:40,619 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:12:40,620 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:12:40,620 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:12:40,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:12:40,620 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:12:40,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:12:40,621 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:12:40,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:12:40,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:12:40,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:12:40,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:12:40,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:12:40,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:12:40,623 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:12:40,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:12:40,623 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:40,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:12:41,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:12:41,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:12:41,027 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:12:41,028 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:12:41,029 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2022-10-15 17:12:41,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0111d28/24eab79adf7446bb88b60cfa6daa7a24/FLAGce461f441 [2022-10-15 17:12:41,788 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:12:41,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2022-10-15 17:12:41,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0111d28/24eab79adf7446bb88b60cfa6daa7a24/FLAGce461f441 [2022-10-15 17:12:42,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0111d28/24eab79adf7446bb88b60cfa6daa7a24 [2022-10-15 17:12:42,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:12:42,179 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:12:42,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:12:42,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:12:42,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:12:42,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:12:42" (1/1) ... [2022-10-15 17:12:42,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b90c9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:42, skipping insertion in model container [2022-10-15 17:12:42,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:12:42" (1/1) ... [2022-10-15 17:12:42,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:12:42,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:12:42,386 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/id_i25_o25-2.c[454,467] [2022-10-15 17:12:42,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:12:42,406 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:12:42,432 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/id_i25_o25-2.c[454,467] [2022-10-15 17:12:42,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:12:42,460 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:12:42,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:42 WrapperNode [2022-10-15 17:12:42,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:12:42,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:12:42,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:12:42,470 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:12:42,482 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:42" (1/1) ... [2022-10-15 17:12:42,491 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:42" (1/1) ... [2022-10-15 17:12:42,514 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-10-15 17:12:42,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:12:42,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:12:42,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:12:42,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:12:42,529 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:42" (1/1) ... [2022-10-15 17:12:42,529 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:42" (1/1) ... [2022-10-15 17:12:42,531 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:42" (1/1) ... [2022-10-15 17:12:42,532 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:42" (1/1) ... [2022-10-15 17:12:42,537 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:42" (1/1) ... [2022-10-15 17:12:42,540 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:42" (1/1) ... [2022-10-15 17:12:42,548 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:42" (1/1) ... [2022-10-15 17:12:42,550 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:42" (1/1) ... [2022-10-15 17:12:42,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:12:42,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:12:42,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:12:42,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:12:42,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:42" (1/1) ... [2022-10-15 17:12:42,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:12:42,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:42,605 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:42,632 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:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:12:42,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:12:42,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:12:42,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:12:42,709 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-10-15 17:12:42,710 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-10-15 17:12:42,820 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:12:42,823 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:12:43,021 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:12:43,038 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:12:43,038 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 17:12:43,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:12:43 BoogieIcfgContainer [2022-10-15 17:12:43,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:12:43,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:12:43,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:12:43,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:12:43,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:12:42" (1/3) ... [2022-10-15 17:12:43,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116cd7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:12:43, skipping insertion in model container [2022-10-15 17:12:43,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:42" (2/3) ... [2022-10-15 17:12:43,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116cd7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:12:43, skipping insertion in model container [2022-10-15 17:12:43,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:12:43" (3/3) ... [2022-10-15 17:12:43,058 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2022-10-15 17:12:43,085 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:12:43,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 17:12:43,178 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:12:43,196 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;@47585db8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:12:43,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 17:12:43,203 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:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:12:43,227 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:43,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:43,230 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1993088021, now seen corresponding path program 1 times [2022-10-15 17:12:43,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:43,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211362420] [2022-10-15 17:12:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:43,672 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:12:43,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:43,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211362420] [2022-10-15 17:12:43,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211362420] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:12:43,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:12:43,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:12:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332229451] [2022-10-15 17:12:43,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:12:43,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:12:43,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:43,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:12:43,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:12:43,738 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, 5 states have (on average 1.6) internal successors, (8), 4 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:12:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:43,799 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-10-15 17:12:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:12:43,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:12:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:43,833 INFO L225 Difference]: With dead ends: 25 [2022-10-15 17:12:43,833 INFO L226 Difference]: Without dead ends: 21 [2022-10-15 17:12:43,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:12:43,849 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:43,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 57 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:12:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-10-15 17:12:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-10-15 17:12:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 17:12:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-10-15 17:12:43,904 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2022-10-15 17:12:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:43,905 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-10-15 17:12:43,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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:12:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-10-15 17:12:43,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:12:43,907 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:43,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:43,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:12:43,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:43,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1993087861, now seen corresponding path program 1 times [2022-10-15 17:12:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:43,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160372163] [2022-10-15 17:12:43,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:43,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:43,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:43,971 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:12:43,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:43,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160372163] [2022-10-15 17:12:43,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160372163] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:12:43,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:12:43,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:12:43,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895980062] [2022-10-15 17:12:43,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:12:43,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:12:43,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:43,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:12:43,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:12:43,977 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:12:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:43,988 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-10-15 17:12:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:12:43,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:12:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:43,990 INFO L225 Difference]: With dead ends: 18 [2022-10-15 17:12:43,991 INFO L226 Difference]: Without dead ends: 15 [2022-10-15 17:12:43,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:12:43,994 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:43,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:12:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-10-15 17:12:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-10-15 17:12:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 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:12:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-10-15 17:12:44,008 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-10-15 17:12:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:44,008 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-10-15 17:12:44,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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:12:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-10-15 17:12:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 17:12:44,012 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:44,013 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:44,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:12:44,013 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:44,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1131436075, now seen corresponding path program 1 times [2022-10-15 17:12:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:44,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288548474] [2022-10-15 17:12:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:44,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:44,511 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:12:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:44,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288548474] [2022-10-15 17:12:44,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288548474] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:44,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567907783] [2022-10-15 17:12:44,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:44,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:44,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:44,524 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:12:44,544 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:12:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:44,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 17:12:44,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:44,744 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:12:44,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:45,058 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:12:45,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567907783] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:45,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:45,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2022-10-15 17:12:45,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906356384] [2022-10-15 17:12:45,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:45,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 17:12:45,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 17:12:45,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:12:45,066 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 17:12:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:45,182 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-10-15 17:12:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:12:45,183 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 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:12:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:45,186 INFO L225 Difference]: With dead ends: 18 [2022-10-15 17:12:45,187 INFO L226 Difference]: Without dead ends: 18 [2022-10-15 17:12:45,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-10-15 17:12:45,202 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:45,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 49 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:12:45,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-10-15 17:12:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-10-15 17:12:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 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:12:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-10-15 17:12:45,226 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-10-15 17:12:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:45,232 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-10-15 17:12:45,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 17:12:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-10-15 17:12:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:12:45,236 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:45,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:45,293 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:12:45,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:45,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:45,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:45,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1751953557, now seen corresponding path program 2 times [2022-10-15 17:12:45,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:45,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619170750] [2022-10-15 17:12:45,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:45,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:45,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 17:12:45,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:45,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619170750] [2022-10-15 17:12:45,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619170750] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184240634] [2022-10-15 17:12:45,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:12:45,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:45,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:45,909 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:12:45,934 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:12:45,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:12:45,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:12:45,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 17:12:45,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:46,122 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:12:46,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:46,509 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:12:46,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184240634] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:46,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:46,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 14 [2022-10-15 17:12:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589931645] [2022-10-15 17:12:46,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:46,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 17:12:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:46,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 17:12:46,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-10-15 17:12:46,513 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-10-15 17:12:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:46,582 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-10-15 17:12:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:12:46,583 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 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:12:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:46,584 INFO L225 Difference]: With dead ends: 21 [2022-10-15 17:12:46,584 INFO L226 Difference]: Without dead ends: 21 [2022-10-15 17:12:46,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-10-15 17:12:46,586 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:46,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 44 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:12:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-10-15 17:12:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-10-15 17:12:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 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:12:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-10-15 17:12:46,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-10-15 17:12:46,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:46,594 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-10-15 17:12:46,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-10-15 17:12:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-10-15 17:12:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 17:12:46,596 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:46,596 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:46,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-15 17:12:46,809 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,SelfDestructingSolverStorable3 [2022-10-15 17:12:46,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1658754005, now seen corresponding path program 3 times [2022-10-15 17:12:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:46,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321167078] [2022-10-15 17:12:46,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:46,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:46,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:46,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:47,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 17:12:47,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:47,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321167078] [2022-10-15 17:12:47,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321167078] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:47,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194879643] [2022-10-15 17:12:47,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 17:12:47,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:47,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:47,116 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:12:47,118 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:12:47,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-15 17:12:47,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:12:47,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 17:12:47,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:47,297 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:12:47,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:47,778 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:12:47,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194879643] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:47,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:47,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2022-10-15 17:12:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4631670] [2022-10-15 17:12:47,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:47,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-15 17:12:47,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:47,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-15 17:12:47,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2022-10-15 17:12:47,784 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 17:12:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:48,073 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-10-15 17:12:48,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-15 17:12:48,075 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) Word has length 28 [2022-10-15 17:12:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:48,076 INFO L225 Difference]: With dead ends: 35 [2022-10-15 17:12:48,076 INFO L226 Difference]: Without dead ends: 33 [2022-10-15 17:12:48,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2022-10-15 17:12:48,079 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:48,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 87 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:12:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-15 17:12:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-15 17:12:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 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:12:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-10-15 17:12:48,088 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-10-15 17:12:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:48,089 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-10-15 17:12:48,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 19 states have internal predecessors, (39), 3 states have call successors, (4), 1 states have call predecessors, (4), 12 states have return successors, (12), 12 states have call predecessors, (12), 3 states have call successors, (12) [2022-10-15 17:12:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-10-15 17:12:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-15 17:12:48,091 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:48,092 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:48,134 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:12:48,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:48,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash 556858325, now seen corresponding path program 4 times [2022-10-15 17:12:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:48,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428059543] [2022-10-15 17:12:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:48,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:48,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:48,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:48,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:48,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:49,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-10-15 17:12:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:49,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428059543] [2022-10-15 17:12:49,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428059543] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:49,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057795967] [2022-10-15 17:12:49,065 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-15 17:12:49,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:49,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:49,069 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:12:49,085 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:12:49,128 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-15 17:12:49,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:12:49,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-15 17:12:49,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:49,241 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:12:49,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:51,553 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:12:51,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057795967] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:51,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:51,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 19] total 24 [2022-10-15 17:12:51,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345470710] [2022-10-15 17:12:51,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:51,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-15 17:12:51,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:51,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-15 17:12:51,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2022-10-15 17:12:51,558 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-10-15 17:12:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:51,680 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-10-15 17:12:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 17:12:51,681 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 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:12:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:51,683 INFO L225 Difference]: With dead ends: 36 [2022-10-15 17:12:51,683 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:12:51,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 99 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=322, Invalid=670, Unknown=0, NotChecked=0, Total=992 [2022-10-15 17:12:51,685 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 113 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:51,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 92 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:12:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:12:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:12:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 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:12:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-10-15 17:12:51,693 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2022-10-15 17:12:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:51,694 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-10-15 17:12:51,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-10-15 17:12:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-10-15 17:12:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 17:12:51,696 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:51,696 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:51,732 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:12:51,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:51,903 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1351152107, now seen corresponding path program 5 times [2022-10-15 17:12:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:51,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122178367] [2022-10-15 17:12:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:52,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:52,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:52,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:52,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:52,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:52,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:52,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-10-15 17:12:52,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:52,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122178367] [2022-10-15 17:12:52,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122178367] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:52,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039795324] [2022-10-15 17:12:52,634 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-15 17:12:52,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:52,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:52,637 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:12:52,656 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:12:52,718 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-10-15 17:12:52,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:12:52,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-15 17:12:52,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:53,021 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:12:53,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:55,784 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:12:55,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039795324] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:55,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:55,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21, 21] total 52 [2022-10-15 17:12:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923293879] [2022-10-15 17:12:55,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:55,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-10-15 17:12:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-10-15 17:12:55,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=2238, Unknown=0, NotChecked=0, Total=2652 [2022-10-15 17:12:55,795 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2022-10-15 17:12:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:56,635 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-10-15 17:12:56,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-10-15 17:12:56,636 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) Word has length 58 [2022-10-15 17:12:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:56,638 INFO L225 Difference]: With dead ends: 65 [2022-10-15 17:12:56,638 INFO L226 Difference]: Without dead ends: 63 [2022-10-15 17:12:56,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1877 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1189, Invalid=6293, Unknown=0, NotChecked=0, Total=7482 [2022-10-15 17:12:56,642 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:56,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 106 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:12:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-15 17:12:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-10-15 17:12:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2022-10-15 17:12:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-10-15 17:12:56,664 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2022-10-15 17:12:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:56,665 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-10-15 17:12:56,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 1 states have call predecessors, (4), 27 states have return successors, (27), 27 states have call predecessors, (27), 3 states have call successors, (27) [2022-10-15 17:12:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-10-15 17:12:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-10-15 17:12:56,671 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:56,671 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:56,720 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:12:56,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:56,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:56,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash 283920341, now seen corresponding path program 6 times [2022-10-15 17:12:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:56,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427034052] [2022-10-15 17:12:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:57,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:57,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:57,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:58,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:58,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:58,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 459 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-10-15 17:12:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:59,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427034052] [2022-10-15 17:12:59,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427034052] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:59,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783786983] [2022-10-15 17:12:59,813 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-15 17:12:59,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:59,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:59,815 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:12:59,834 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:12:59,972 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-10-15 17:12:59,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:12:59,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-15 17:12:59,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:13:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-10-15 17:13:00,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:13:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-10-15 17:13:22,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783786983] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:13:22,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:13:22,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 39, 39] total 76 [2022-10-15 17:13:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845693337] [2022-10-15 17:13:22,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:13:22,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-10-15 17:13:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:13:22,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-10-15 17:13:22,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=882, Invalid=4818, Unknown=0, NotChecked=0, Total=5700 [2022-10-15 17:13:22,537 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 76 states, 75 states have (on average 1.36) internal successors, (102), 50 states have internal predecessors, (102), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2022-10-15 17:13:24,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:13:24,100 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-10-15 17:13:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-10-15 17:13:24,101 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.36) internal successors, (102), 50 states have internal predecessors, (102), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) Word has length 112 [2022-10-15 17:13:24,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:13:24,103 INFO L225 Difference]: With dead ends: 89 [2022-10-15 17:13:24,103 INFO L226 Difference]: Without dead ends: 87 [2022-10-15 17:13:24,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 184 SyntacticMatches, 21 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5005 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2611, Invalid=13391, Unknown=0, NotChecked=0, Total=16002 [2022-10-15 17:13:24,110 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:13:24,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 117 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:13:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-10-15 17:13:24,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-10-15 17:13:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2022-10-15 17:13:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-10-15 17:13:24,122 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 112 [2022-10-15 17:13:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:13:24,123 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-10-15 17:13:24,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.36) internal successors, (102), 50 states have internal predecessors, (102), 3 states have call successors, (4), 1 states have call predecessors, (4), 43 states have return successors, (44), 44 states have call predecessors, (44), 3 states have call successors, (44) [2022-10-15 17:13:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-10-15 17:13:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-10-15 17:13:24,126 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:13:24,126 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:13:24,153 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:24,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:13:24,342 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:13:24,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:13:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1598089259, now seen corresponding path program 7 times [2022-10-15 17:13:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:13:24,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149410132] [2022-10-15 17:13:24,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:13:24,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:13:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:13:24,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:13:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:13:24,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:13:24,498 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:13:24,499 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 17:13:24,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 17:13:24,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:13:24,506 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2022-10-15 17:13:24,511 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:13:24,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:13:24 BoogieIcfgContainer [2022-10-15 17:13:24,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:13:24,576 INFO L158 Benchmark]: Toolchain (without parser) took 42402.06ms. Allocated memory was 151.0MB in the beginning and 390.1MB in the end (delta: 239.1MB). Free memory was 125.8MB in the beginning and 232.0MB in the end (delta: -106.2MB). Peak memory consumption was 133.5MB. Max. memory is 8.0GB. [2022-10-15 17:13:24,577 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 151.0MB. Free memory was 121.0MB in the beginning and 121.0MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:13:24,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.89ms. Allocated memory is still 151.0MB. Free memory was 125.6MB in the beginning and 116.3MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 17:13:24,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.05ms. Allocated memory is still 151.0MB. Free memory was 116.3MB in the beginning and 114.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:13:24,578 INFO L158 Benchmark]: Boogie Preprocessor took 37.07ms. Allocated memory is still 151.0MB. Free memory was 114.9MB in the beginning and 114.0MB in the end (delta: 956.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:13:24,579 INFO L158 Benchmark]: RCFGBuilder took 485.42ms. Allocated memory is still 151.0MB. Free memory was 114.0MB in the beginning and 105.0MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 17:13:24,580 INFO L158 Benchmark]: TraceAbstraction took 41528.57ms. Allocated memory was 151.0MB in the beginning and 390.1MB in the end (delta: 239.1MB). Free memory was 104.4MB in the beginning and 232.0MB in the end (delta: -127.6MB). Peak memory consumption was 112.5MB. Max. memory is 8.0GB. [2022-10-15 17:13:24,582 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.28ms. Allocated memory is still 151.0MB. Free memory was 121.0MB in the beginning and 121.0MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.89ms. Allocated memory is still 151.0MB. Free memory was 125.6MB in the beginning and 116.3MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.05ms. Allocated memory is still 151.0MB. Free memory was 116.3MB in the beginning and 114.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.07ms. Allocated memory is still 151.0MB. Free memory was 114.9MB in the beginning and 114.0MB in the end (delta: 956.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 485.42ms. Allocated memory is still 151.0MB. Free memory was 114.0MB in the beginning and 105.0MB in the end (delta: 8.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 41528.57ms. Allocated memory was 151.0MB in the beginning and 390.1MB in the end (delta: 239.1MB). Free memory was 104.4MB in the beginning and 232.0MB in the end (delta: -127.6MB). Peak memory consumption was 112.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 15]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 15. Possible FailurePath: [L12] int input = 25; VAL [input=25] [L13] CALL, EXPR id(input) VAL [\old(x)=25] [L7] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L8] CALL, EXPR id(x-1) VAL [\old(x)=24] [L7] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L8] CALL, EXPR id(x-1) VAL [\old(x)=23] [L7] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L8] CALL, EXPR id(x-1) VAL [\old(x)=22] [L7] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L8] CALL, EXPR id(x-1) VAL [\old(x)=21] [L7] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L8] CALL, EXPR id(x-1) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=21, id(x-1)=20, x=21] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=22, id(x-1)=21, x=22] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=23, id(x-1)=22, x=23] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=24, id(x-1)=23, x=24] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=25, id(x-1)=24, x=25] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [id(input)=25, input=25] [L13] int result = id(input); [L14] COND TRUE result == 25 VAL [input=25, result=25] [L15] reach_error() VAL [input=25, result=25] - UnprovableResult [Line: 11]: 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: 41.4s, OverallIterations: 9, TraceHistogramMax: 26, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 354 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 574 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 489 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 624 IncrementalHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 85 mSDtfsCounter, 624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 839 GetRequests, 494 SyntacticMatches, 34 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7641 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=8, InterpolantAutomatonStates: 146, 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, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 35.3s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 864 ConstructedInterpolants, 0 QuantifiedInterpolants, 2062 SizeOfPredicates, 13 NumberOfNonLiveVariables, 820 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 1837/3858 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:24,658 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...