/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/heap-data/running_example.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:47:01,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:47:01,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:47:01,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:47:01,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:47:01,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:47:01,277 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:47:01,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:47:01,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:47:01,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:47:01,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:47:01,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:47:01,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:47:01,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:47:01,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:47:01,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:47:01,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:47:01,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:47:01,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:47:01,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:47:01,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:47:01,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:47:01,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:47:01,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:47:01,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:47:01,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:47:01,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:47:01,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:47:01,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:47:01,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:47:01,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:47:01,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:47:01,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:47:01,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:47:01,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:47:01,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:47:01,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:47:01,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:47:01,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:47:01,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:47:01,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:47:01,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:47:01,421 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:47:01,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:47:01,422 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:47:01,422 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:47:01,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:47:01,425 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:47:01,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:47:01,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:47:01,428 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:47:01,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:47:01,429 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:47:01,430 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:47:01,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:47:01,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:47:01,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:47:01,431 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:47:01,431 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:47:01,431 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:47:01,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:47:01,432 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:47:01,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:47:01,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:47:01,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:47:01,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:47:01,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:47:01,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:47:01,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:47:01,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:47:01,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:47:01,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:47:01,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:47:01,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:47:01,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:47:01,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:47:01,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:47:01,863 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:47:01,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/running_example.i [2022-10-15 16:47:01,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d3ab8e3/b1185c519f2348439b67e55fcb19bc39/FLAG0bffc7d44 [2022-10-15 16:47:02,583 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:47:02,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/running_example.i [2022-10-15 16:47:02,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d3ab8e3/b1185c519f2348439b67e55fcb19bc39/FLAG0bffc7d44 [2022-10-15 16:47:02,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24d3ab8e3/b1185c519f2348439b67e55fcb19bc39 [2022-10-15 16:47:02,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:47:02,867 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:47:02,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:47:02,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:47:02,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:47:02,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224ef104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:02, skipping insertion in model container [2022-10-15 16:47:02,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:47:02" (1/1) ... [2022-10-15 16:47:02,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:47:02,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:47:03,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/heap-data/running_example.i[23610,23623] [2022-10-15 16:47:03,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:47:03,401 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:47:03,439 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/heap-data/running_example.i[23610,23623] [2022-10-15 16:47:03,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:47:03,480 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:47:03,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03 WrapperNode [2022-10-15 16:47:03,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:47:03,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:47:03,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:47:03,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:47:03,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,539 INFO L138 Inliner]: procedures = 121, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2022-10-15 16:47:03,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:47:03,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:47:03,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:47:03,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:47:03,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,568 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:47:03,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:47:03,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:47:03,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:47:03,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:47:03,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:03,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:47:03,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:47:03,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:47:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:47:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:47:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:47:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 16:47:03,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 16:47:03,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:47:03,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:47:03,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:47:03,891 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:47:03,894 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:47:04,241 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:47:04,248 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:47:04,248 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-15 16:47:04,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:47:04 BoogieIcfgContainer [2022-10-15 16:47:04,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:47:04,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:47:04,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:47:04,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:47:04,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:47:02" (1/3) ... [2022-10-15 16:47:04,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486b47f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:47:04, skipping insertion in model container [2022-10-15 16:47:04,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03" (2/3) ... [2022-10-15 16:47:04,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486b47f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:47:04, skipping insertion in model container [2022-10-15 16:47:04,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:47:04" (3/3) ... [2022-10-15 16:47:04,261 INFO L112 eAbstractionObserver]: Analyzing ICFG running_example.i [2022-10-15 16:47:04,281 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:47:04,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-10-15 16:47:04,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:47:04,346 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;@726c8d21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:47:04,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-10-15 16:47:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:47:04,359 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:04,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:47:04,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:04,366 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-15 16:47:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:04,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804300060] [2022-10-15 16:47:04,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:04,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:04,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804300060] [2022-10-15 16:47:04,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804300060] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:04,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:04,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194589191] [2022-10-15 16:47:04,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:04,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:04,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:04,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:04,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:04,653 INFO L87 Difference]: Start difference. First operand has 63 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:04,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:04,725 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-10-15 16:47:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:04,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-15 16:47:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:04,738 INFO L225 Difference]: With dead ends: 57 [2022-10-15 16:47:04,739 INFO L226 Difference]: Without dead ends: 57 [2022-10-15 16:47:04,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:04,745 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:04,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 34 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:47:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-15 16:47:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-10-15 16:47:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.9375) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-10-15 16:47:04,790 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 3 [2022-10-15 16:47:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:04,790 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-10-15 16:47:04,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-10-15 16:47:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:47:04,791 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:04,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:47:04,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:47:04,792 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-15 16:47:04,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:04,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965120967] [2022-10-15 16:47:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:04,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:04,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:04,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965120967] [2022-10-15 16:47:04,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965120967] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:04,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:04,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:04,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270473112] [2022-10-15 16:47:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:04,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:04,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:04,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:04,911 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:04,998 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-10-15 16:47:04,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:04,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-15 16:47:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,000 INFO L225 Difference]: With dead ends: 55 [2022-10-15 16:47:05,000 INFO L226 Difference]: Without dead ends: 55 [2022-10-15 16:47:05,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:05,005 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 34 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:05,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-15 16:47:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-10-15 16:47:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.875) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-10-15 16:47:05,019 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 3 [2022-10-15 16:47:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,019 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-10-15 16:47:05,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-10-15 16:47:05,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 16:47:05,023 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:05,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:47:05,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:05,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1839913389, now seen corresponding path program 1 times [2022-10-15 16:47:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485808273] [2022-10-15 16:47:05,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:05,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485808273] [2022-10-15 16:47:05,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485808273] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:05,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774040719] [2022-10-15 16:47:05,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:05,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:05,286 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,396 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-10-15 16:47:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:47:05,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 16:47:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,398 INFO L225 Difference]: With dead ends: 105 [2022-10-15 16:47:05,398 INFO L226 Difference]: Without dead ends: 105 [2022-10-15 16:47:05,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:05,401 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 61 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 93 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-10-15 16:47:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 60. [2022-10-15 16:47:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.837837837837838) internal successors, (68), 59 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-10-15 16:47:05,412 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 9 [2022-10-15 16:47:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,412 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-10-15 16:47:05,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-10-15 16:47:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 16:47:05,413 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:05,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:47:05,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:05,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1839913390, now seen corresponding path program 1 times [2022-10-15 16:47:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631900611] [2022-10-15 16:47:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:05,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631900611] [2022-10-15 16:47:05,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631900611] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:05,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:05,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:47:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276108986] [2022-10-15 16:47:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:05,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:47:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:47:05,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:47:05,766 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:05,886 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-10-15 16:47:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:05,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 16:47:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:05,889 INFO L225 Difference]: With dead ends: 104 [2022-10-15 16:47:05,889 INFO L226 Difference]: Without dead ends: 104 [2022-10-15 16:47:05,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:47:05,892 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 162 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:05,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 56 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-15 16:47:05,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 60. [2022-10-15 16:47:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-10-15 16:47:05,903 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 9 [2022-10-15 16:47:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:05,903 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-10-15 16:47:05,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-10-15 16:47:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:47:05,905 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:05,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:47:05,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1202701701, now seen corresponding path program 1 times [2022-10-15 16:47:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887947185] [2022-10-15 16:47:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:06,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887947185] [2022-10-15 16:47:06,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887947185] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:06,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117776408] [2022-10-15 16:47:06,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:06,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:06,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:06,039 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:06,144 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-10-15 16:47:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:47:06,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 16:47:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:06,146 INFO L225 Difference]: With dead ends: 55 [2022-10-15 16:47:06,146 INFO L226 Difference]: Without dead ends: 55 [2022-10-15 16:47:06,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:06,148 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 89 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:06,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 31 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-15 16:47:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-10-15 16:47:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-10-15 16:47:06,156 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 10 [2022-10-15 16:47:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:06,156 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-10-15 16:47:06,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-10-15 16:47:06,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:47:06,158 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:06,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:06,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:47:06,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:06,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1202701702, now seen corresponding path program 1 times [2022-10-15 16:47:06,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:06,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136283673] [2022-10-15 16:47:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:06,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136283673] [2022-10-15 16:47:06,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136283673] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:06,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37236334] [2022-10-15 16:47:06,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:06,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:06,346 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:06,463 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-10-15 16:47:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:47:06,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 16:47:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:06,465 INFO L225 Difference]: With dead ends: 70 [2022-10-15 16:47:06,465 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 16:47:06,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:06,467 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 96 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:06,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 44 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 16:47:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2022-10-15 16:47:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 65 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2022-10-15 16:47:06,476 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 10 [2022-10-15 16:47:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:06,476 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2022-10-15 16:47:06,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2022-10-15 16:47:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:47:06,478 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:06,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:06,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:47:06,478 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:06,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1213999890, now seen corresponding path program 1 times [2022-10-15 16:47:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:06,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333699391] [2022-10-15 16:47:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:06,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333699391] [2022-10-15 16:47:06,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333699391] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:47:06,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431634455] [2022-10-15 16:47:06,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:47:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:47:06,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:47:06,620 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:06,727 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2022-10-15 16:47:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:47:06,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:47:06,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:06,729 INFO L225 Difference]: With dead ends: 84 [2022-10-15 16:47:06,729 INFO L226 Difference]: Without dead ends: 84 [2022-10-15 16:47:06,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:47:06,731 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:06,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 154 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-10-15 16:47:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2022-10-15 16:47:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-10-15 16:47:06,740 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 14 [2022-10-15 16:47:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:06,740 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-10-15 16:47:06,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-10-15 16:47:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:47:06,741 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:06,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:06,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:47:06,742 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1571396459, now seen corresponding path program 1 times [2022-10-15 16:47:06,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:06,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704540450] [2022-10-15 16:47:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704540450] [2022-10-15 16:47:06,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704540450] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 16:47:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740590955] [2022-10-15 16:47:06,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:47:06,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:47:06,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:47:06,937 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,088 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-10-15 16:47:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:47:07,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-15 16:47:07,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,090 INFO L225 Difference]: With dead ends: 82 [2022-10-15 16:47:07,090 INFO L226 Difference]: Without dead ends: 82 [2022-10-15 16:47:07,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:47:07,092 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:07,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 171 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-15 16:47:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2022-10-15 16:47:07,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 73 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2022-10-15 16:47:07,119 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 16 [2022-10-15 16:47:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:07,120 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2022-10-15 16:47:07,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-10-15 16:47:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:47:07,121 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:07,122 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:07,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:47:07,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:07,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash 611733665, now seen corresponding path program 1 times [2022-10-15 16:47:07,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:07,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004107175] [2022-10-15 16:47:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:07,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:07,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004107175] [2022-10-15 16:47:07,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004107175] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:07,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:07,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:07,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743216858] [2022-10-15 16:47:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:07,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:07,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:07,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:07,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:07,239 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,295 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-10-15 16:47:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:47:07,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:47:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,297 INFO L225 Difference]: With dead ends: 74 [2022-10-15 16:47:07,297 INFO L226 Difference]: Without dead ends: 74 [2022-10-15 16:47:07,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:07,298 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 74 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:07,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 35 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:47:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-15 16:47:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-10-15 16:47:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 72 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2022-10-15 16:47:07,305 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 17 [2022-10-15 16:47:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:07,305 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2022-10-15 16:47:07,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-10-15 16:47:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:47:07,307 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:07,307 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:07,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:47:07,307 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash 611733666, now seen corresponding path program 1 times [2022-10-15 16:47:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:07,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642858732] [2022-10-15 16:47:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:07,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:07,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642858732] [2022-10-15 16:47:07,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642858732] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:07,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003851320] [2022-10-15 16:47:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:07,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:07,501 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 16:47:07,521 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 16:47:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 16:47:07,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:07,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:07,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:07,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:07,834 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:07,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:07,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:14,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-10-15 16:47:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:14,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003851320] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:14,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:14,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-10-15 16:47:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929898886] [2022-10-15 16:47:14,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:14,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 16:47:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 16:47:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:47:14,380 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:14,519 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-10-15 16:47:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:47:14,519 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:47:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:14,520 INFO L225 Difference]: With dead ends: 73 [2022-10-15 16:47:14,521 INFO L226 Difference]: Without dead ends: 73 [2022-10-15 16:47:14,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:47:14,522 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 169 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:14,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 85 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-10-15 16:47:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-15 16:47:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-10-15 16:47:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 70 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-10-15 16:47:14,528 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 17 [2022-10-15 16:47:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:14,528 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-10-15 16:47:14,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-10-15 16:47:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:47:14,530 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:14,530 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:14,568 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 16:47:14,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-15 16:47:14,745 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:14,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2081384838, now seen corresponding path program 1 times [2022-10-15 16:47:14,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239330092] [2022-10-15 16:47:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:14,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:15,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:15,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239330092] [2022-10-15 16:47:15,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239330092] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:15,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232704048] [2022-10-15 16:47:15,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:15,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:15,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:15,172 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 16:47:15,181 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 16:47:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:15,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-15 16:47:15,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:15,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:15,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 16:47:15,467 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:15,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:15,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:15,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-15 16:47:15,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:15,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:15,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:15,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:15,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-10-15 16:47:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:15,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:15,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_278 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_32| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_32|) 21) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_32| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-10-15 16:47:15,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_275 Int) (v_ArrVal_278 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_32| |c_ULTIMATE.start_main_~list~0#1.offset|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_275)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_32|) 21))) is different from false [2022-10-15 16:47:15,989 INFO L356 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2022-10-15 16:47:15,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 41 [2022-10-15 16:47:16,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:16,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-10-15 16:47:16,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-15 16:47:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:16,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232704048] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:16,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:16,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-10-15 16:47:16,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68635506] [2022-10-15 16:47:16,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:16,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-15 16:47:16,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:16,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-15 16:47:16,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=386, Unknown=3, NotChecked=82, Total=552 [2022-10-15 16:47:16,207 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:16,896 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (<= |c_ULTIMATE.start_main_~list~0#1.offset| |c_ULTIMATE.start_main_~tail~0#1.offset|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_275 Int) (v_ArrVal_278 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_32| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_32|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_32| |c_ULTIMATE.start_main_~list~0#1.offset|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_275)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_278) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_32|) 21))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 10) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~tail~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2022-10-15 16:47:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:17,263 INFO L93 Difference]: Finished difference Result 153 states and 177 transitions. [2022-10-15 16:47:17,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:47:17,264 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:47:17,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:17,265 INFO L225 Difference]: With dead ends: 153 [2022-10-15 16:47:17,266 INFO L226 Difference]: Without dead ends: 153 [2022-10-15 16:47:17,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=182, Invalid=638, Unknown=4, NotChecked=168, Total=992 [2022-10-15 16:47:17,267 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 221 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:17,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 404 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 278 Invalid, 0 Unknown, 229 Unchecked, 0.2s Time] [2022-10-15 16:47:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-10-15 16:47:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2022-10-15 16:47:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.337837837837838) internal successors, (99), 83 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2022-10-15 16:47:17,274 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 22 [2022-10-15 16:47:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:17,274 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2022-10-15 16:47:17,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2022-10-15 16:47:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:47:17,276 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:17,276 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:17,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 16:47:17,489 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,SelfDestructingSolverStorable10 [2022-10-15 16:47:17,490 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:17,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1142767915, now seen corresponding path program 1 times [2022-10-15 16:47:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:17,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070945534] [2022-10-15 16:47:17,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:17,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:17,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:17,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070945534] [2022-10-15 16:47:17,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070945534] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:17,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:17,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:47:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360135068] [2022-10-15 16:47:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:17,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:47:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:47:17,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:17,637 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:17,714 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2022-10-15 16:47:17,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:47:17,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 16:47:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:17,719 INFO L225 Difference]: With dead ends: 90 [2022-10-15 16:47:17,719 INFO L226 Difference]: Without dead ends: 90 [2022-10-15 16:47:17,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:47:17,721 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 19 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:17,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 121 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-15 16:47:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2022-10-15 16:47:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 85 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2022-10-15 16:47:17,736 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 24 [2022-10-15 16:47:17,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:17,737 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2022-10-15 16:47:17,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2022-10-15 16:47:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:47:17,740 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:17,740 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:17,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:47:17,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1238116855, now seen corresponding path program 1 times [2022-10-15 16:47:17,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:17,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220620040] [2022-10-15 16:47:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:18,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:18,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220620040] [2022-10-15 16:47:18,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220620040] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:18,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465231327] [2022-10-15 16:47:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:18,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:18,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:18,217 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 16:47:18,237 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 16:47:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:18,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-15 16:47:18,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:18,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:18,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 16:47:18,441 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:18,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:18,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:18,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-15 16:47:18,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:18,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:18,631 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:18,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:18,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-10-15 16:47:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:18,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:18,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_373 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (<= 10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-10-15 16:47:18,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_371 Int) (v_ArrVal_373 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (<= 10 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_371)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-10-15 16:47:18,986 INFO L356 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2022-10-15 16:47:18,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 41 [2022-10-15 16:47:19,000 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:19,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2022-10-15 16:47:19,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-15 16:47:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:19,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465231327] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:19,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:19,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2022-10-15 16:47:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952053868] [2022-10-15 16:47:19,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:19,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-15 16:47:19,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:19,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-15 16:47:19,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=424, Unknown=3, NotChecked=86, Total=600 [2022-10-15 16:47:19,176 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:19,835 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (<= |c_ULTIMATE.start_main_~list~0#1.offset| |c_ULTIMATE.start_main_~tail~0#1.offset|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~tail~0#1.base|) (<= 10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_371 Int) (v_ArrVal_373 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (<= 10 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_371)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~list~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|))))) is different from false [2022-10-15 16:47:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:20,365 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2022-10-15 16:47:20,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-15 16:47:20,366 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 16:47:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:20,367 INFO L225 Difference]: With dead ends: 149 [2022-10-15 16:47:20,367 INFO L226 Difference]: Without dead ends: 149 [2022-10-15 16:47:20,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=768, Unknown=4, NotChecked=186, Total=1190 [2022-10-15 16:47:20,369 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 183 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:20,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 434 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 355 Invalid, 0 Unknown, 255 Unchecked, 0.3s Time] [2022-10-15 16:47:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-10-15 16:47:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 89. [2022-10-15 16:47:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 88 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2022-10-15 16:47:20,373 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 24 [2022-10-15 16:47:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:20,373 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2022-10-15 16:47:20,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2022-10-15 16:47:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:47:20,375 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:20,375 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:20,418 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 16:47:20,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:20,577 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:20,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1058477809, now seen corresponding path program 1 times [2022-10-15 16:47:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:20,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057658647] [2022-10-15 16:47:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:20,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:20,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:20,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057658647] [2022-10-15 16:47:20,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057658647] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:20,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818047198] [2022-10-15 16:47:20,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:20,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:20,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:20,928 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 16:47:20,945 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 16:47:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:20,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 31 conjunts are in the unsatisfiable core [2022-10-15 16:47:21,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:21,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:21,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:21,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:21,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-15 16:47:21,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:21,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-15 16:47:21,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:21,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-15 16:47:21,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:21,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-15 16:47:21,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:21,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-10-15 16:47:21,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:21,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:21,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-10-15 16:47:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:21,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:24,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-10-15 16:47:24,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2022-10-15 16:47:24,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-10-15 16:47:24,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:26,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:26,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818047198] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:26,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:26,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 13 [2022-10-15 16:47:26,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142768131] [2022-10-15 16:47:26,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:26,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 16:47:26,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 16:47:26,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=121, Unknown=2, NotChecked=0, Total=156 [2022-10-15 16:47:26,329 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:26,641 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2022-10-15 16:47:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:47:26,642 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-15 16:47:26,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:26,643 INFO L225 Difference]: With dead ends: 99 [2022-10-15 16:47:26,643 INFO L226 Difference]: Without dead ends: 99 [2022-10-15 16:47:26,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=93, Invalid=247, Unknown=2, NotChecked=0, Total=342 [2022-10-15 16:47:26,644 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 122 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:26,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 230 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 159 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2022-10-15 16:47:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-10-15 16:47:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2022-10-15 16:47:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2022-10-15 16:47:26,648 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 25 [2022-10-15 16:47:26,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:26,648 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2022-10-15 16:47:26,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-10-15 16:47:26,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:47:26,649 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:26,650 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:26,687 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 16:47:26,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:26,861 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:26,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:26,862 INFO L85 PathProgramCache]: Analyzing trace with hash -245822458, now seen corresponding path program 2 times [2022-10-15 16:47:26,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:26,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442363395] [2022-10-15 16:47:26,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:26,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:27,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442363395] [2022-10-15 16:47:27,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442363395] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:27,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110658870] [2022-10-15 16:47:27,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:47:27,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:27,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:27,474 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 16:47:27,476 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 16:47:27,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:47:27,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:47:27,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-15 16:47:27,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:27,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:27,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 16:47:27,718 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:27,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:27,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:27,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-15 16:47:27,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:27,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:27,912 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:27,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:27,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:27,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:27,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:28,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:28,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:28,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-10-15 16:47:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:28,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:28,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_41| Int) (v_ArrVal_543 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_41|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_41| |c_ULTIMATE.start_main_~list~0#1.offset|)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_543) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_41|) 21))) is different from false [2022-10-15 16:47:28,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_41| Int) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_41|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_543) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_41|) 21) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_41| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-10-15 16:47:28,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_52| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_41| Int) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_541) |v_ULTIMATE.start_main_~p~0#1.base_52| v_ArrVal_543) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_41|) 21) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_41|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_52|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_41| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-10-15 16:47:28,415 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-15 16:47:28,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-10-15 16:47:28,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_52| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_41| Int) (v_ArrVal_537 Int) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_41|)) (= |v_ULTIMATE.start_main_~p~0#1.base_52| |c_ULTIMATE.start_main_~tail~0#1.base|) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_41| |c_ULTIMATE.start_main_~list~0#1.offset|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_537)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_541) |v_ULTIMATE.start_main_~p~0#1.base_52| v_ArrVal_543) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_41|) 21))) is different from false [2022-10-15 16:47:28,677 INFO L356 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2022-10-15 16:47:28,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2022-10-15 16:47:28,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:28,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 130 [2022-10-15 16:47:28,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-10-15 16:47:28,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-10-15 16:47:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-10-15 16:47:28,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110658870] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:28,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:28,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2022-10-15 16:47:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315858098] [2022-10-15 16:47:28,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:28,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-15 16:47:28,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-15 16:47:28,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=701, Unknown=6, NotChecked=228, Total=1056 [2022-10-15 16:47:28,989 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 33 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:29,774 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (<= |c_ULTIMATE.start_main_~list~0#1.offset| |c_ULTIMATE.start_main_~tail~0#1.offset|) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 10) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~tail~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~p~0#1.base_52| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_41| Int) (v_ArrVal_537 Int) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_41|)) (= |v_ULTIMATE.start_main_~p~0#1.base_52| |c_ULTIMATE.start_main_~tail~0#1.base|) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_41| |c_ULTIMATE.start_main_~list~0#1.offset|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |c_ULTIMATE.start_main_~tail~0#1.offset| 4) v_ArrVal_537)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_541) |v_ULTIMATE.start_main_~p~0#1.base_52| v_ArrVal_543) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_41|) 21)))) is different from false [2022-10-15 16:47:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:30,317 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-10-15 16:47:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:47:30,318 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-15 16:47:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:30,319 INFO L225 Difference]: With dead ends: 163 [2022-10-15 16:47:30,319 INFO L226 Difference]: Without dead ends: 163 [2022-10-15 16:47:30,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=239, Invalid=1106, Unknown=7, NotChecked=370, Total=1722 [2022-10-15 16:47:30,321 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 341 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:30,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 532 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 468 Invalid, 0 Unknown, 530 Unchecked, 0.3s Time] [2022-10-15 16:47:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-10-15 16:47:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 101. [2022-10-15 16:47:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 91 states have (on average 1.2857142857142858) internal successors, (117), 100 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2022-10-15 16:47:30,325 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 30 [2022-10-15 16:47:30,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:30,326 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2022-10-15 16:47:30,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2022-10-15 16:47:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 16:47:30,327 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:30,327 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:30,369 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 16:47:30,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 16:47:30,540 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:30,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1823193358, now seen corresponding path program 1 times [2022-10-15 16:47:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:30,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387263021] [2022-10-15 16:47:30,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:30,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:30,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387263021] [2022-10-15 16:47:30,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387263021] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:30,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379462389] [2022-10-15 16:47:30,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:30,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:30,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:30,820 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 16:47:30,838 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 16:47:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:30,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-15 16:47:30,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:31,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-15 16:47:31,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:31,289 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:31,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-10-15 16:47:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:31,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:40,996 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-10-15 16:47:40,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2022-10-15 16:47:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:41,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379462389] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:41,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:41,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 29 [2022-10-15 16:47:41,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811845050] [2022-10-15 16:47:41,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:41,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-15 16:47:41,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:41,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-15 16:47:41,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=682, Unknown=8, NotChecked=0, Total=812 [2022-10-15 16:47:41,230 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 29 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:42,878 INFO L93 Difference]: Finished difference Result 167 states and 199 transitions. [2022-10-15 16:47:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-15 16:47:42,878 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-10-15 16:47:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:42,880 INFO L225 Difference]: With dead ends: 167 [2022-10-15 16:47:42,880 INFO L226 Difference]: Without dead ends: 167 [2022-10-15 16:47:42,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=689, Invalid=2383, Unknown=8, NotChecked=0, Total=3080 [2022-10-15 16:47:42,883 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 391 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:42,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 447 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 426 Invalid, 0 Unknown, 384 Unchecked, 0.4s Time] [2022-10-15 16:47:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-10-15 16:47:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 104. [2022-10-15 16:47:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 103 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2022-10-15 16:47:42,887 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 31 [2022-10-15 16:47:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:42,887 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2022-10-15 16:47:42,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.689655172413793) internal successors, (78), 29 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2022-10-15 16:47:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:47:42,889 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:42,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:42,920 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 16:47:43,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 16:47:43,103 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1896087905, now seen corresponding path program 1 times [2022-10-15 16:47:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:43,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16980242] [2022-10-15 16:47:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:43,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:43,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16980242] [2022-10-15 16:47:43,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16980242] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:43,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748603716] [2022-10-15 16:47:43,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:43,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:43,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:43,510 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:47:43,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 16:47:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:43,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 31 conjunts are in the unsatisfiable core [2022-10-15 16:47:43,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:43,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:43,677 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 16:47:43,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 16:47:43,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:43,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-15 16:47:43,784 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:47:43,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-10-15 16:47:43,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:43,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-10-15 16:47:44,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:44,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-10-15 16:47:44,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:44,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:44,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:44,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-10-15 16:47:44,373 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:44,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-10-15 16:47:44,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:46,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748603716] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:46,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:46,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2022-10-15 16:47:46,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524083014] [2022-10-15 16:47:46,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:46,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-15 16:47:46,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:46,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-15 16:47:46,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=664, Unknown=1, NotChecked=0, Total=756 [2022-10-15 16:47:46,895 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:47,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:47,933 INFO L93 Difference]: Finished difference Result 199 states and 242 transitions. [2022-10-15 16:47:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-15 16:47:47,934 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 16:47:47,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:47,935 INFO L225 Difference]: With dead ends: 199 [2022-10-15 16:47:47,935 INFO L226 Difference]: Without dead ends: 199 [2022-10-15 16:47:47,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=326, Invalid=1835, Unknown=1, NotChecked=0, Total=2162 [2022-10-15 16:47:47,937 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 293 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:47,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 600 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 511 Invalid, 0 Unknown, 358 Unchecked, 0.4s Time] [2022-10-15 16:47:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-10-15 16:47:47,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 124. [2022-10-15 16:47:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 114 states have (on average 1.263157894736842) internal successors, (144), 123 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2022-10-15 16:47:47,942 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 32 [2022-10-15 16:47:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:47,943 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2022-10-15 16:47:47,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2022-10-15 16:47:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:47:47,944 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:47,944 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:47,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 16:47:48,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:48,157 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:48,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash -17994621, now seen corresponding path program 2 times [2022-10-15 16:47:48,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:48,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117796966] [2022-10-15 16:47:48,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:48,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:48,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:48,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117796966] [2022-10-15 16:47:48,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117796966] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:48,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665493167] [2022-10-15 16:47:48,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:47:48,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:48,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:48,753 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:47:48,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 16:47:48,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:47:48,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:47:48,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-15 16:47:48,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:48,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:48,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 16:47:49,002 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:49,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:49,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:49,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-15 16:47:49,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:49,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:49,175 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:49,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:49,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:49,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:49,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:49,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:49,375 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:49,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-10-15 16:47:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:49,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:49,521 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_791 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_54| Int)) (or (<= 10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_54|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_54|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_54| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-10-15 16:47:49,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int)) (v_ArrVal_791 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_54| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_54|)) (<= 10 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~tail~0#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_791) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_54|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_54| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-10-15 16:47:49,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_65| Int) (v_ArrVal_791 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_54| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_54|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_54| |c_ULTIMATE.start_main_~list~0#1.offset|)) (<= 10 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_789) |v_ULTIMATE.start_main_~p~0#1.base_65| v_ArrVal_791) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_54|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~p~0#1.base_65|) 0)))) is different from false [2022-10-15 16:47:49,728 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-15 16:47:49,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-10-15 16:47:50,028 INFO L356 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2022-10-15 16:47:50,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2022-10-15 16:47:50,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:50,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 130 [2022-10-15 16:47:50,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-10-15 16:47:50,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-10-15 16:47:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-10-15 16:47:50,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665493167] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:50,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:50,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 35 [2022-10-15 16:47:50,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461050325] [2022-10-15 16:47:50,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:50,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-10-15 16:47:50,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:50,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-10-15 16:47:50,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=863, Unknown=24, NotChecked=186, Total=1190 [2022-10-15 16:47:50,344 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:51,571 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2022-10-15 16:47:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-15 16:47:51,571 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 16:47:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:51,575 INFO L225 Difference]: With dead ends: 210 [2022-10-15 16:47:51,575 INFO L226 Difference]: Without dead ends: 210 [2022-10-15 16:47:51,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=354, Invalid=1889, Unknown=25, NotChecked=282, Total=2550 [2022-10-15 16:47:51,577 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 255 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:51,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 640 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 708 Invalid, 0 Unknown, 602 Unchecked, 0.5s Time] [2022-10-15 16:47:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-10-15 16:47:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 132. [2022-10-15 16:47:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 131 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2022-10-15 16:47:51,581 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 32 [2022-10-15 16:47:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:51,582 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2022-10-15 16:47:51,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2022-10-15 16:47:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 16:47:51,585 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:51,585 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:51,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 16:47:51,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 16:47:51,801 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-10-15 16:47:51,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:51,802 INFO L85 PathProgramCache]: Analyzing trace with hash 252025967, now seen corresponding path program 1 times [2022-10-15 16:47:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:51,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270885957] [2022-10-15 16:47:51,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:51,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:52,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270885957] [2022-10-15 16:47:52,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270885957] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:52,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016665045] [2022-10-15 16:47:52,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:52,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:52,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:52,187 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:47:52,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 16:47:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:52,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-15 16:47:52,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:52,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-15 16:47:52,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:52,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:52,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-10-15 16:47:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:52,848 INFO L328 TraceCheckSpWp]: Computing backward predicates...