/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/ldv-regression/test27-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:58:04,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:58:04,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:58:04,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:58:04,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:58:04,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:58:04,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:58:04,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:58:04,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:58:04,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:58:04,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:58:04,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:58:04,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:58:04,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:58:04,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:58:04,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:58:04,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:58:04,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:58:04,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:58:04,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:58:04,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:58:04,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:58:04,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:58:04,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:58:04,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:58:04,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:58:04,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:58:04,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:58:04,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:58:04,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:58:04,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:58:04,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:58:04,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:58:04,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:58:04,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:58:04,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:58:04,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:58:04,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:58:04,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:58:04,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:58:04,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:58:04,485 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:58:04,541 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:58:04,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:58:04,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:58:04,542 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:58:04,544 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:58:04,545 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:58:04,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:58:04,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:58:04,549 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:58:04,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:58:04,550 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:58:04,550 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:58:04,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:58:04,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:58:04,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:58:04,551 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:58:04,551 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:58:04,552 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:58:04,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:58:04,552 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:58:04,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:58:04,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:58:04,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:58:04,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:58:04,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:58:04,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:58:04,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:58:04,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:58:04,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:58:04,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:58:04,554 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:58:05,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:58:05,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:58:05,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:58:05,072 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:58:05,073 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:58:05,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test27-2.c [2022-10-15 16:58:05,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492994de9/16ff0ee6aa0b42c5a58ec3ba09048434/FLAGb757f43b5 [2022-10-15 16:58:05,782 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:58:05,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test27-2.c [2022-10-15 16:58:05,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492994de9/16ff0ee6aa0b42c5a58ec3ba09048434/FLAGb757f43b5 [2022-10-15 16:58:06,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492994de9/16ff0ee6aa0b42c5a58ec3ba09048434 [2022-10-15 16:58:06,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:58:06,156 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:58:06,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:58:06,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:58:06,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:58:06,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745a97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06, skipping insertion in model container [2022-10-15 16:58:06,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:58:06,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:58:06,469 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/ldv-regression/test27-2.c[1224,1237] [2022-10-15 16:58:06,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:58:06,484 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:58:06,510 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/ldv-regression/test27-2.c[1224,1237] [2022-10-15 16:58:06,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:58:06,529 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:58:06,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06 WrapperNode [2022-10-15 16:58:06,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:58:06,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:58:06,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:58:06,531 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:58:06,540 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:58:06" (1/1) ... [2022-10-15 16:58:06,550 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:58:06" (1/1) ... [2022-10-15 16:58:06,578 INFO L138 Inliner]: procedures = 16, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2022-10-15 16:58:06,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:58:06,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:58:06,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:58:06,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:58:06,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:58:06,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:58:06,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:58:06,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:58:06,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06" (1/1) ... [2022-10-15 16:58:06,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:58:06,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:06,654 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:58:06,660 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:58:06,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 16:58:06,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:58:06,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:58:06,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 16:58:06,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:58:06,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:58:06,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:58:06,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:58:06,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:58:06,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:58:06,816 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:58:06,818 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:58:07,336 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:58:07,344 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:58:07,345 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 16:58:07,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:58:07 BoogieIcfgContainer [2022-10-15 16:58:07,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:58:07,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:58:07,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:58:07,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:58:07,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:58:06" (1/3) ... [2022-10-15 16:58:07,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f98bdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:58:07, skipping insertion in model container [2022-10-15 16:58:07,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:58:06" (2/3) ... [2022-10-15 16:58:07,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f98bdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:58:07, skipping insertion in model container [2022-10-15 16:58:07,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:58:07" (3/3) ... [2022-10-15 16:58:07,363 INFO L112 eAbstractionObserver]: Analyzing ICFG test27-2.c [2022-10-15 16:58:07,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:58:07,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-10-15 16:58:07,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:58:07,462 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;@26adf713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:58:07,462 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-10-15 16:58:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 36 states have (on average 2.25) internal successors, (81), 74 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:58:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:58:07,476 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:07,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:58:07,478 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:07,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-10-15 16:58:07,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:07,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699940862] [2022-10-15 16:58:07,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:07,856 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:58:07,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:07,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699940862] [2022-10-15 16:58:07,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699940862] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:07,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:07,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:58:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882390543] [2022-10-15 16:58:07,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:07,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:58:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:07,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:58:07,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:58:07,910 INFO L87 Difference]: Start difference. First operand has 75 states, 36 states have (on average 2.25) internal successors, (81), 74 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:58:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:08,014 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-10-15 16:58:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:58:08,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:58:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:08,027 INFO L225 Difference]: With dead ends: 72 [2022-10-15 16:58:08,027 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 16:58:08,033 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:58:08,038 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 68 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:08,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 39 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 16:58:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-15 16:58:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 35 states have (on average 2.085714285714286) internal successors, (73), 69 states have internal predecessors, (73), 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:58:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-10-15 16:58:08,080 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 4 [2022-10-15 16:58:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:08,081 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-10-15 16:58:08,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:58:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-10-15 16:58:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:58:08,082 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:08,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:58:08,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:58:08,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:08,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:08,084 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-10-15 16:58:08,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:08,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447956722] [2022-10-15 16:58:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:08,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:08,355 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:58:08,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:08,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447956722] [2022-10-15 16:58:08,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447956722] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:08,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:08,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:58:08,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797184853] [2022-10-15 16:58:08,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:08,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:58:08,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:08,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:58:08,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:58:08,360 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:58:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:08,464 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-10-15 16:58:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:58:08,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:58:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:08,466 INFO L225 Difference]: With dead ends: 77 [2022-10-15 16:58:08,466 INFO L226 Difference]: Without dead ends: 77 [2022-10-15 16:58:08,467 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:58:08,469 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:08,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 99 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-15 16:58:08,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-10-15 16:58:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 37 states have (on average 2.027027027027027) internal successors, (75), 71 states have internal predecessors, (75), 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:58:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-10-15 16:58:08,481 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 4 [2022-10-15 16:58:08,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:08,481 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-10-15 16:58:08,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:58:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-10-15 16:58:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:58:08,482 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:08,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:58:08,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:58:08,483 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:08,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:08,484 INFO L85 PathProgramCache]: Analyzing trace with hash 889659654, now seen corresponding path program 1 times [2022-10-15 16:58:08,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:08,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077544464] [2022-10-15 16:58:08,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:08,724 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:58:08,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:08,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077544464] [2022-10-15 16:58:08,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077544464] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:08,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:08,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:58:08,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909327560] [2022-10-15 16:58:08,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:08,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:58:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:08,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:58:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:58:08,728 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:58:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:08,804 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-10-15 16:58:08,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:58:08,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-10-15 16:58:08,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:08,806 INFO L225 Difference]: With dead ends: 69 [2022-10-15 16:58:08,806 INFO L226 Difference]: Without dead ends: 69 [2022-10-15 16:58:08,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:58:08,809 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:08,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 36 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:08,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-15 16:58:08,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-10-15 16:58:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.945945945945946) internal successors, (72), 68 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:58:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2022-10-15 16:58:08,819 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 6 [2022-10-15 16:58:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:08,819 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2022-10-15 16:58:08,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:58:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-10-15 16:58:08,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:58:08,820 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:08,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:58:08,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:58:08,821 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:08,822 INFO L85 PathProgramCache]: Analyzing trace with hash 889659655, now seen corresponding path program 1 times [2022-10-15 16:58:08,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:08,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437593644] [2022-10-15 16:58:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:08,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:09,038 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:58:09,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:09,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437593644] [2022-10-15 16:58:09,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437593644] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:09,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:09,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:58:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565481371] [2022-10-15 16:58:09,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:09,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:58:09,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:09,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:58:09,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:58:09,045 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:58:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:09,205 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-10-15 16:58:09,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:58:09,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-10-15 16:58:09,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:09,209 INFO L225 Difference]: With dead ends: 72 [2022-10-15 16:58:09,210 INFO L226 Difference]: Without dead ends: 72 [2022-10-15 16:58:09,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:58:09,212 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:09,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 122 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-15 16:58:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-10-15 16:58:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 70 states have internal predecessors, (74), 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:58:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-10-15 16:58:09,224 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 6 [2022-10-15 16:58:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:09,225 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-10-15 16:58:09,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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:58:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-10-15 16:58:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 16:58:09,226 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:09,226 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:09,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:58:09,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:09,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:09,228 INFO L85 PathProgramCache]: Analyzing trace with hash -392442511, now seen corresponding path program 1 times [2022-10-15 16:58:09,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:09,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719884041] [2022-10-15 16:58:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:09,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:09,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719884041] [2022-10-15 16:58:09,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719884041] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:09,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419419526] [2022-10-15 16:58:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:09,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:09,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:09,460 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:58:09,468 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:58:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:09,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 16:58:09,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:09,785 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-10-15 16:58:09,787 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 3 case distinctions, treesize of input 15 treesize of output 42 [2022-10-15 16:58:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:09,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:10,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419419526] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:10,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:10,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-10-15 16:58:10,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602966303] [2022-10-15 16:58:10,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:10,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:58:10,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:10,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:58:10,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:58:10,076 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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:58:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:10,392 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-10-15 16:58:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:58:10,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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:58:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:10,395 INFO L225 Difference]: With dead ends: 84 [2022-10-15 16:58:10,396 INFO L226 Difference]: Without dead ends: 84 [2022-10-15 16:58:10,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:58:10,409 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 95 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:10,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 172 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:58:10,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-10-15 16:58:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-10-15 16:58:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.7058823529411764) internal successors, (87), 81 states have internal predecessors, (87), 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:58:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-10-15 16:58:10,433 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 9 [2022-10-15 16:58:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:10,436 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-10-15 16:58:10,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 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:58:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-10-15 16:58:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 16:58:10,438 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:10,438 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-10-15 16:58:10,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 16:58:10,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:10,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:10,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash 819867506, now seen corresponding path program 1 times [2022-10-15 16:58:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:10,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093499691] [2022-10-15 16:58:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:10,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:10,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:10,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093499691] [2022-10-15 16:58:10,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093499691] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:10,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91308160] [2022-10-15 16:58:10,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:10,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:10,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:10,825 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:58:10,832 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:58:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:10,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 16:58:10,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:10,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:58:11,028 INFO L356 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-10-15 16:58:11,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 15 treesize of output 38 [2022-10-15 16:58:11,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 414 treesize of output 406 [2022-10-15 16:58:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:11,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:11,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91308160] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:11,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:11,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-10-15 16:58:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236460607] [2022-10-15 16:58:11,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:11,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:58:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:11,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:58:11,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:58:11,375 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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:58:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:11,554 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-10-15 16:58:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:58:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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 11 [2022-10-15 16:58:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:11,555 INFO L225 Difference]: With dead ends: 85 [2022-10-15 16:58:11,556 INFO L226 Difference]: Without dead ends: 85 [2022-10-15 16:58:11,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:58:11,557 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:11,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 178 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-10-15 16:58:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-10-15 16:58:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 84 states have internal predecessors, (88), 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:58:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-10-15 16:58:11,565 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 11 [2022-10-15 16:58:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:11,566 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-10-15 16:58:11,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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:58:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-10-15 16:58:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:58:11,567 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:11,567 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2022-10-15 16:58:11,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-15 16:58:11,780 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,SelfDestructingSolverStorable5 [2022-10-15 16:58:11,781 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:11,782 INFO L85 PathProgramCache]: Analyzing trace with hash 963161288, now seen corresponding path program 1 times [2022-10-15 16:58:11,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:11,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638647101] [2022-10-15 16:58:11,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 16:58:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:12,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638647101] [2022-10-15 16:58:12,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638647101] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:12,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:12,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:58:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473391205] [2022-10-15 16:58:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:12,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:58:12,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:12,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:58:12,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:58:12,058 INFO L87 Difference]: Start difference. First operand 85 states and 88 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:58:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:12,145 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-10-15 16:58:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:58:12,146 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 25 [2022-10-15 16:58:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:12,147 INFO L225 Difference]: With dead ends: 84 [2022-10-15 16:58:12,147 INFO L226 Difference]: Without dead ends: 84 [2022-10-15 16:58:12,147 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:58:12,148 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 87 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:12,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 48 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-10-15 16:58:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-10-15 16:58:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.5925925925925926) internal successors, (86), 82 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:58:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-10-15 16:58:12,155 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 25 [2022-10-15 16:58:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:12,156 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-10-15 16:58:12,156 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:58:12,156 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-10-15 16:58:12,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:58:12,157 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:12,158 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:12,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:58:12,158 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:12,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash -206692696, now seen corresponding path program 1 times [2022-10-15 16:58:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:12,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834533929] [2022-10-15 16:58:12,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:12,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:12,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834533929] [2022-10-15 16:58:12,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834533929] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:12,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288182712] [2022-10-15 16:58:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:12,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:12,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:12,339 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:58:12,343 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:58:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:12,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 16:58:12,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:12,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:12,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288182712] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:12,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:12,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-10-15 16:58:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257515895] [2022-10-15 16:58:12,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:12,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 16:58:12,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:12,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 16:58:12,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:58:12,564 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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:58:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:12,651 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2022-10-15 16:58:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 16:58:12,653 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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 26 [2022-10-15 16:58:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:12,654 INFO L225 Difference]: With dead ends: 115 [2022-10-15 16:58:12,654 INFO L226 Difference]: Without dead ends: 115 [2022-10-15 16:58:12,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:58:12,656 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:12,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 307 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:12,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-10-15 16:58:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2022-10-15 16:58:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 109 states have internal predecessors, (118), 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:58:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2022-10-15 16:58:12,683 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 26 [2022-10-15 16:58:12,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:12,684 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2022-10-15 16:58:12,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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:58:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2022-10-15 16:58:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 16:58:12,685 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:12,686 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2022-10-15 16:58:12,727 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:58:12,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:12,887 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash -206725433, now seen corresponding path program 2 times [2022-10-15 16:58:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:12,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735514215] [2022-10-15 16:58:12,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:12,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,534 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:13,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:13,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735514215] [2022-10-15 16:58:13,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735514215] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:13,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819759925] [2022-10-15 16:58:13,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:58:13,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:13,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:13,537 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:58:13,563 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:58:13,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 16:58:13,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:58:13,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 16:58:13,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:13,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:58:13,709 INFO L356 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-10-15 16:58:13,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 15 treesize of output 38 [2022-10-15 16:58:13,736 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 202 treesize of output 198 [2022-10-15 16:58:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 16:58:13,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-10-15 16:58:14,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819759925] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:14,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:14,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2022-10-15 16:58:14,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148200123] [2022-10-15 16:58:14,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:14,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 16:58:14,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:14,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 16:58:14,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:58:14,407 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 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:58:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:14,960 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-10-15 16:58:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 16:58:14,961 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 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 26 [2022-10-15 16:58:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:14,962 INFO L225 Difference]: With dead ends: 109 [2022-10-15 16:58:14,962 INFO L226 Difference]: Without dead ends: 109 [2022-10-15 16:58:14,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2022-10-15 16:58:14,966 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 145 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:14,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 275 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:58:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-10-15 16:58:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-10-15 16:58:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.382716049382716) internal successors, (112), 108 states have internal predecessors, (112), 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:58:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 112 transitions. [2022-10-15 16:58:14,975 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 112 transitions. Word has length 26 [2022-10-15 16:58:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:14,978 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 112 transitions. [2022-10-15 16:58:14,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 14 states have internal predecessors, (46), 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:58:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 112 transitions. [2022-10-15 16:58:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-15 16:58:14,981 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:14,982 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:15,026 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:58:15,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:15,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:15,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1940969656, now seen corresponding path program 2 times [2022-10-15 16:58:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:15,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103743856] [2022-10-15 16:58:15,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:15,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-10-15 16:58:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:17,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103743856] [2022-10-15 16:58:17,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103743856] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:17,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:17,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:58:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401453809] [2022-10-15 16:58:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:17,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:58:17,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:58:17,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:58:17,180 INFO L87 Difference]: Start difference. First operand 109 states and 112 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:58:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:17,258 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2022-10-15 16:58:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:58:17,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 56 [2022-10-15 16:58:17,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:17,260 INFO L225 Difference]: With dead ends: 108 [2022-10-15 16:58:17,260 INFO L226 Difference]: Without dead ends: 106 [2022-10-15 16:58:17,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:58:17,262 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 55 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:17,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 54 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-15 16:58:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-10-15 16:58:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 105 states have internal predecessors, (107), 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:58:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-10-15 16:58:17,267 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 56 [2022-10-15 16:58:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:17,267 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-10-15 16:58:17,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:58:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-10-15 16:58:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-15 16:58:17,269 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:17,269 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:17,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:58:17,270 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:17,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:17,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1941048136, now seen corresponding path program 1 times [2022-10-15 16:58:17,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:17,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977108939] [2022-10-15 16:58:17,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:17,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-10-15 16:58:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:17,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977108939] [2022-10-15 16:58:17,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977108939] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:17,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:17,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:58:17,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006340014] [2022-10-15 16:58:17,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:17,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:58:17,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:17,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:58:17,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:58:17,773 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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:58:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:17,822 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2022-10-15 16:58:17,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:58:17,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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 56 [2022-10-15 16:58:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:17,824 INFO L225 Difference]: With dead ends: 105 [2022-10-15 16:58:17,824 INFO L226 Difference]: Without dead ends: 105 [2022-10-15 16:58:17,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:58:17,825 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:17,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 30 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-10-15 16:58:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-10-15 16:58:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 104 states have internal predecessors, (106), 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:58:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2022-10-15 16:58:17,831 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 56 [2022-10-15 16:58:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:17,831 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2022-10-15 16:58:17,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 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:58:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-10-15 16:58:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-15 16:58:17,833 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:17,833 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:17,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:58:17,834 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1941048135, now seen corresponding path program 1 times [2022-10-15 16:58:17,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:17,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324076920] [2022-10-15 16:58:17,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:17,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-10-15 16:58:18,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:18,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324076920] [2022-10-15 16:58:18,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324076920] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:18,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:18,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:58:18,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886392152] [2022-10-15 16:58:18,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:18,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:58:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:18,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:58:18,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:58:18,379 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:58:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:18,426 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-10-15 16:58:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:58:18,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 56 [2022-10-15 16:58:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:18,428 INFO L225 Difference]: With dead ends: 104 [2022-10-15 16:58:18,428 INFO L226 Difference]: Without dead ends: 104 [2022-10-15 16:58:18,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:58:18,429 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:18,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 28 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:18,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-15 16:58:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-10-15 16:58:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 103 states have internal predecessors, (105), 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:58:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2022-10-15 16:58:18,433 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 56 [2022-10-15 16:58:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:18,433 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2022-10-15 16:58:18,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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:58:18,434 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-10-15 16:58:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-15 16:58:18,435 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:18,435 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:18,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:58:18,436 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:18,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:18,436 INFO L85 PathProgramCache]: Analyzing trace with hash -42950069, now seen corresponding path program 1 times [2022-10-15 16:58:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:18,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870384377] [2022-10-15 16:58:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:18,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:18,930 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 172 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:18,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:18,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870384377] [2022-10-15 16:58:18,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870384377] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:18,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231035892] [2022-10-15 16:58:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:18,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:18,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:18,932 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:58:18,956 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:58:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:19,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 16:58:19,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 216 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:19,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:19,550 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 25 treesize of output 21 [2022-10-15 16:58:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 216 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:19,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231035892] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:19,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:19,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-10-15 16:58:19,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066195101] [2022-10-15 16:58:19,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:19,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-15 16:58:19,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:19,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-15 16:58:19,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2022-10-15 16:58:19,932 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 38 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 38 states have internal predecessors, (169), 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:58:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:20,433 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-10-15 16:58:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 16:58:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 38 states have internal predecessors, (169), 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 57 [2022-10-15 16:58:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:20,435 INFO L225 Difference]: With dead ends: 102 [2022-10-15 16:58:20,435 INFO L226 Difference]: Without dead ends: 102 [2022-10-15 16:58:20,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=659, Invalid=1693, Unknown=0, NotChecked=0, Total=2352 [2022-10-15 16:58:20,437 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 411 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:20,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 138 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:58:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-15 16:58:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-10-15 16:58:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 101 states have internal predecessors, (103), 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:58:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2022-10-15 16:58:20,441 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 57 [2022-10-15 16:58:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:20,441 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2022-10-15 16:58:20,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.5675675675675675) internal successors, (169), 38 states have internal predecessors, (169), 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:58:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2022-10-15 16:58:20,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 16:58:20,443 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:20,443 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:20,487 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:58:20,655 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,SelfDestructingSolverStorable12 [2022-10-15 16:58:20,656 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:20,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:20,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1331452165, now seen corresponding path program 1 times [2022-10-15 16:58:20,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:20,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811864001] [2022-10-15 16:58:20,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:20,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-10-15 16:58:21,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:21,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811864001] [2022-10-15 16:58:21,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811864001] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:21,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:21,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:58:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776728132] [2022-10-15 16:58:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:21,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:58:21,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:21,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:58:21,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:58:21,189 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:58:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:21,229 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-10-15 16:58:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:58:21,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 58 [2022-10-15 16:58:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:21,231 INFO L225 Difference]: With dead ends: 100 [2022-10-15 16:58:21,231 INFO L226 Difference]: Without dead ends: 100 [2022-10-15 16:58:21,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:58:21,232 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:21,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 25 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-15 16:58:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-10-15 16:58:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 99 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:58:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-10-15 16:58:21,236 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 58 [2022-10-15 16:58:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:21,236 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-10-15 16:58:21,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:58:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-10-15 16:58:21,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-15 16:58:21,237 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:21,237 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:21,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:58:21,238 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:21,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:21,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1331452164, now seen corresponding path program 1 times [2022-10-15 16:58:21,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:21,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276509067] [2022-10-15 16:58:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:21,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-10-15 16:58:22,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:22,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276509067] [2022-10-15 16:58:22,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276509067] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:22,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:22,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:58:22,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519155563] [2022-10-15 16:58:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:22,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:58:22,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:22,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:58:22,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:58:22,250 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:58:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:22,294 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-10-15 16:58:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:58:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-10-15 16:58:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:22,295 INFO L225 Difference]: With dead ends: 98 [2022-10-15 16:58:22,295 INFO L226 Difference]: Without dead ends: 98 [2022-10-15 16:58:22,296 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:58:22,296 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:22,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:22,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-15 16:58:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-10-15 16:58:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 97 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:58:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-10-15 16:58:22,300 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 58 [2022-10-15 16:58:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:22,301 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-10-15 16:58:22,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:58:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-10-15 16:58:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-15 16:58:22,301 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:22,302 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:22,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 16:58:22,302 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:22,303 INFO L85 PathProgramCache]: Analyzing trace with hash 374723902, now seen corresponding path program 1 times [2022-10-15 16:58:22,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:22,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221239053] [2022-10-15 16:58:22,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:22,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-10-15 16:58:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:22,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221239053] [2022-10-15 16:58:22,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221239053] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:22,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:22,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:58:22,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275488962] [2022-10-15 16:58:22,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:22,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:58:22,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:22,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:58:22,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:58:22,644 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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:58:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:22,713 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-10-15 16:58:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:58:22,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 60 [2022-10-15 16:58:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:22,715 INFO L225 Difference]: With dead ends: 97 [2022-10-15 16:58:22,715 INFO L226 Difference]: Without dead ends: 97 [2022-10-15 16:58:22,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:58:22,716 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 84 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:22,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 49 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-10-15 16:58:22,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-10-15 16:58:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.240506329113924) internal successors, (98), 96 states have internal predecessors, (98), 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:58:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-10-15 16:58:22,720 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 60 [2022-10-15 16:58:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:22,720 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-10-15 16:58:22,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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:58:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-10-15 16:58:22,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-15 16:58:22,721 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:22,721 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:22,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 16:58:22,722 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:22,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:22,722 INFO L85 PathProgramCache]: Analyzing trace with hash 374723903, now seen corresponding path program 1 times [2022-10-15 16:58:22,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:22,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044194369] [2022-10-15 16:58:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:22,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-10-15 16:58:23,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:23,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044194369] [2022-10-15 16:58:23,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044194369] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:23,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:23,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:58:23,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105009349] [2022-10-15 16:58:23,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:23,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:58:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:58:23,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:58:23,327 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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:58:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:23,450 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-10-15 16:58:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:58:23,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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 60 [2022-10-15 16:58:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:23,452 INFO L225 Difference]: With dead ends: 96 [2022-10-15 16:58:23,452 INFO L226 Difference]: Without dead ends: 96 [2022-10-15 16:58:23,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:58:23,454 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 60 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:23,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 103 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-15 16:58:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-10-15 16:58:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 95 states have internal predecessors, (97), 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:58:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-10-15 16:58:23,458 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 60 [2022-10-15 16:58:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:23,458 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-10-15 16:58:23,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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:58:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-10-15 16:58:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-15 16:58:23,462 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:23,462 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:23,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 16:58:23,462 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:58:23,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1268460912, now seen corresponding path program 1 times [2022-10-15 16:58:23,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:23,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652309188] [2022-10-15 16:58:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:58:23,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:58:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:58:23,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:58:23,877 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:58:23,879 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 38 remaining) [2022-10-15 16:58:23,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2022-10-15 16:58:23,881 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2022-10-15 16:58:23,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2022-10-15 16:58:23,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2022-10-15 16:58:23,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2022-10-15 16:58:23,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2022-10-15 16:58:23,882 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2022-10-15 16:58:23,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2022-10-15 16:58:23,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2022-10-15 16:58:23,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2022-10-15 16:58:23,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2022-10-15 16:58:23,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2022-10-15 16:58:23,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2022-10-15 16:58:23,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2022-10-15 16:58:23,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2022-10-15 16:58:23,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2022-10-15 16:58:23,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2022-10-15 16:58:23,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2022-10-15 16:58:23,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2022-10-15 16:58:23,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2022-10-15 16:58:23,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2022-10-15 16:58:23,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2022-10-15 16:58:23,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2022-10-15 16:58:23,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2022-10-15 16:58:23,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2022-10-15 16:58:23,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2022-10-15 16:58:23,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2022-10-15 16:58:23,890 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2022-10-15 16:58:23,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2022-10-15 16:58:23,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2022-10-15 16:58:23,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 38 remaining) [2022-10-15 16:58:23,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 38 remaining) [2022-10-15 16:58:23,891 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 38 remaining) [2022-10-15 16:58:23,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 38 remaining) [2022-10-15 16:58:23,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 38 remaining) [2022-10-15 16:58:23,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (1 of 38 remaining) [2022-10-15 16:58:23,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2022-10-15 16:58:23,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 16:58:23,901 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:23,909 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:58:24,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:58:24 BoogieIcfgContainer [2022-10-15 16:58:24,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:58:24,021 INFO L158 Benchmark]: Toolchain (without parser) took 17871.03ms. Allocated memory was 160.4MB in the beginning and 343.9MB in the end (delta: 183.5MB). Free memory was 134.8MB in the beginning and 175.9MB in the end (delta: -41.2MB). Peak memory consumption was 142.4MB. Max. memory is 8.0GB. [2022-10-15 16:58:24,022 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 160.4MB. Free memory was 130.0MB in the beginning and 129.8MB in the end (delta: 151.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:58:24,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.07ms. Allocated memory is still 160.4MB. Free memory was 134.6MB in the beginning and 124.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:58:24,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.18ms. Allocated memory is still 160.4MB. Free memory was 124.2MB in the beginning and 122.3MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:58:24,024 INFO L158 Benchmark]: Boogie Preprocessor took 35.69ms. Allocated memory is still 160.4MB. Free memory was 122.3MB in the beginning and 120.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:58:24,024 INFO L158 Benchmark]: RCFGBuilder took 731.45ms. Allocated memory is still 160.4MB. Free memory was 120.6MB in the beginning and 138.9MB in the end (delta: -18.3MB). Peak memory consumption was 21.6MB. Max. memory is 8.0GB. [2022-10-15 16:58:24,024 INFO L158 Benchmark]: TraceAbstraction took 16670.22ms. Allocated memory was 160.4MB in the beginning and 343.9MB in the end (delta: 183.5MB). Free memory was 138.4MB in the beginning and 175.9MB in the end (delta: -37.5MB). Peak memory consumption was 146.0MB. Max. memory is 8.0GB. [2022-10-15 16:58:24,033 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 160.4MB. Free memory was 130.0MB in the beginning and 129.8MB in the end (delta: 151.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 369.07ms. Allocated memory is still 160.4MB. Free memory was 134.6MB in the beginning and 124.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.18ms. Allocated memory is still 160.4MB. Free memory was 124.2MB in the beginning and 122.3MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.69ms. Allocated memory is still 160.4MB. Free memory was 122.3MB in the beginning and 120.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 731.45ms. Allocated memory is still 160.4MB. Free memory was 120.6MB in the beginning and 138.9MB in the end (delta: -18.3MB). Peak memory consumption was 21.6MB. Max. memory is 8.0GB. * TraceAbstraction took 16670.22ms. Allocated memory was 160.4MB in the beginning and 343.9MB in the end (delta: 183.5MB). Free memory was 138.4MB in the beginning and 175.9MB in the end (delta: -37.5MB). Peak memory consumption was 146.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L23] struct cont cont; [L24] struct dummy dummy; [L25] struct dummy *dummies[10]; [L26] int a[10]; [L27] int i, *pa; [L28] i = __VERIFIER_nondet_int() [L29] int j = 0; VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=0] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=0] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=0] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=1] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=1] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=1] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=2] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=2] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=2] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=3] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-4, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=3] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=3] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=4] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-5, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=4] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=4] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=5] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-6, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=5] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=5] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=6] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-7, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=6] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=6] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=7] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-8, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=7] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=7] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=8] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-9, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=8] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=8] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=9] [L29] COND TRUE j < 10 [L30] a[j] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=10, a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=9] [L34] dummies[j] = 0 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=9] [L29] j++ VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L29] COND FALSE !(j < 10) VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L36] COND TRUE i >= 0 && i < 9 VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L37] a[i] = i VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L38] dummy.array = &a[i] VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L39] dummies[i + 1] = &dummy VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L40] cont.array = &dummies[0] VAL [a={7:0}, cont={9:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L41] EXPR cont.array VAL [a={7:0}, cont={9:0}, cont.array={5:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L41] EXPR cont.array[i] VAL [a={7:0}, cont={9:0}, cont.array={5:0}, cont.array[i]={0:0}, dummies={5:0}, dummy={6:0}, i=8, j=10] [L41] cont.array[i]->array - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 75 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1514 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1514 mSDsluCounter, 1728 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1066 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1918 IncrementalHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 662 mSDtfsCounter, 1918 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=8, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 768 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 10577 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1124 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 2355/2642 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-15 16:58:24,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...