/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/array-tiling/revcpyswp2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:28:12,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:28:12,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:28:12,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:28:12,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:28:12,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:28:12,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:28:12,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:28:12,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:28:12,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:28:12,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:28:12,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:28:12,873 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:28:12,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:28:12,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:28:12,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:28:12,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:28:12,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:28:12,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:28:12,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:28:12,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:28:12,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:28:12,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:28:12,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:28:12,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:28:12,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:28:12,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:28:12,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:28:12,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:28:12,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:28:12,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:28:12,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:28:12,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:28:12,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:28:12,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:28:12,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:28:12,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:28:12,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:28:12,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:28:12,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:28:12,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:28:12,913 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:28:12,947 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:28:12,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:28:12,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:28:12,948 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:28:12,949 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:28:12,949 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:28:12,950 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:28:12,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:28:12,950 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:28:12,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:28:12,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:28:12,951 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:28:12,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:28:12,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:28:12,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:28:12,952 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:28:12,952 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:28:12,953 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:28:12,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:28:12,953 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:28:12,953 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:28:12,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:28:12,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:28:12,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:28:12,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:28:12,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:28:12,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:28:12,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:28:12,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:28:12,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:28:12,956 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:28:13,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:28:13,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:28:13,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:28:13,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:28:13,445 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:28:13,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/revcpyswp2.c [2022-10-15 16:28:13,528 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d85c282/28e54eda57314a57b3ce6c3bcf143fa1/FLAG3bcaf715e [2022-10-15 16:28:14,174 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:28:14,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/revcpyswp2.c [2022-10-15 16:28:14,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d85c282/28e54eda57314a57b3ce6c3bcf143fa1/FLAG3bcaf715e [2022-10-15 16:28:14,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d85c282/28e54eda57314a57b3ce6c3bcf143fa1 [2022-10-15 16:28:14,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:28:14,553 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:28:14,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:28:14,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:28:14,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:28:14,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:14,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e83000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14, skipping insertion in model container [2022-10-15 16:28:14,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:14,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:28:14,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:28:14,766 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/array-tiling/revcpyswp2.c[432,445] [2022-10-15 16:28:14,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:28:14,844 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:28:14,864 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/array-tiling/revcpyswp2.c[432,445] [2022-10-15 16:28:14,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:28:14,927 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:28:14,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14 WrapperNode [2022-10-15 16:28:14,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:28:14,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:28:14,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:28:14,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:28:14,947 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:28:14" (1/1) ... [2022-10-15 16:28:14,972 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:28:14" (1/1) ... [2022-10-15 16:28:15,027 INFO L138 Inliner]: procedures = 16, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2022-10-15 16:28:15,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:28:15,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:28:15,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:28:15,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:28:15,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:15,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:15,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:15,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:15,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:15,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:15,092 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:15,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:15,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:28:15,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:28:15,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:28:15,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:28:15,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14" (1/1) ... [2022-10-15 16:28:15,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:28:15,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:15,145 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:28:15,149 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:28:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:28:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:28:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:28:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:28:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:28:15,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:28:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:28:15,366 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:28:15,369 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:28:15,893 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:28:15,908 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:28:15,908 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-15 16:28:15,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:28:15 BoogieIcfgContainer [2022-10-15 16:28:15,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:28:15,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:28:15,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:28:15,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:28:15,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:28:14" (1/3) ... [2022-10-15 16:28:15,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4763c002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:28:15, skipping insertion in model container [2022-10-15 16:28:15,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:14" (2/3) ... [2022-10-15 16:28:15,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4763c002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:28:15, skipping insertion in model container [2022-10-15 16:28:15,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:28:15" (3/3) ... [2022-10-15 16:28:15,926 INFO L112 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2022-10-15 16:28:15,954 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:28:15,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-10-15 16:28:16,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:28:16,066 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;@26757c5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:28:16,066 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-10-15 16:28:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:28:16,102 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:16,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:28:16,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:16,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash 28693957, now seen corresponding path program 1 times [2022-10-15 16:28:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:16,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152234120] [2022-10-15 16:28:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:16,782 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:28:16,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:16,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152234120] [2022-10-15 16:28:16,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152234120] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:16,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:16,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:28:16,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726518495] [2022-10-15 16:28:16,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:16,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:28:16,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:16,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:28:16,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:28:16,832 INFO L87 Difference]: Start difference. First operand has 83 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:17,057 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-10-15 16:28:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:28:17,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:28:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:17,074 INFO L225 Difference]: With dead ends: 92 [2022-10-15 16:28:17,074 INFO L226 Difference]: Without dead ends: 90 [2022-10-15 16:28:17,076 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:28:17,082 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:17,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:28:17,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-15 16:28:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2022-10-15 16:28:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 states have internal predecessors, (89), 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:28:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-10-15 16:28:17,139 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 5 [2022-10-15 16:28:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:17,140 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-10-15 16:28:17,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-10-15 16:28:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:28:17,141 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:17,141 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:28:17,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:28:17,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:17,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2022-10-15 16:28:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:17,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072060040] [2022-10-15 16:28:17,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:17,449 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:28:17,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:17,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072060040] [2022-10-15 16:28:17,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072060040] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:17,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:17,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:28:17,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382208912] [2022-10-15 16:28:17,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:17,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:28:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:17,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:28:17,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:28:17,458 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:17,577 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-10-15 16:28:17,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:28:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:28:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:17,585 INFO L225 Difference]: With dead ends: 83 [2022-10-15 16:28:17,585 INFO L226 Difference]: Without dead ends: 83 [2022-10-15 16:28:17,587 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:28:17,591 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 78 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:17,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 54 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-10-15 16:28:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-10-15 16:28:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-10-15 16:28:17,617 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 5 [2022-10-15 16:28:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:17,617 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-10-15 16:28:17,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-10-15 16:28:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:28:17,621 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:17,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:28:17,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:28:17,622 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:17,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:17,633 INFO L85 PathProgramCache]: Analyzing trace with hash 28830798, now seen corresponding path program 1 times [2022-10-15 16:28:17,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:17,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306791494] [2022-10-15 16:28:17,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:17,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:17,670 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:28:17,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:17,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306791494] [2022-10-15 16:28:17,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306791494] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:17,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:17,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:28:17,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89037422] [2022-10-15 16:28:17,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:17,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:28:17,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:17,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:28:17,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:28:17,677 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:17,763 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-10-15 16:28:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:28:17,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:28:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:17,770 INFO L225 Difference]: With dead ends: 82 [2022-10-15 16:28:17,771 INFO L226 Difference]: Without dead ends: 80 [2022-10-15 16:28:17,772 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:28:17,780 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:17,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-15 16:28:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-10-15 16:28:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 79 states have internal predecessors, (84), 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:28:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-10-15 16:28:17,799 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 5 [2022-10-15 16:28:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:17,800 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-10-15 16:28:17,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-10-15 16:28:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:28:17,802 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:17,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:17,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:28:17,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:17,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1805087525, now seen corresponding path program 1 times [2022-10-15 16:28:17,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:17,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616084191] [2022-10-15 16:28:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:17,927 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:28:17,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:17,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616084191] [2022-10-15 16:28:17,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616084191] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:17,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:17,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:28:17,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670128061] [2022-10-15 16:28:17,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:17,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:28:17,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:28:17,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:28:17,934 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:28:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:17,993 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-10-15 16:28:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:28:17,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-10-15 16:28:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:17,995 INFO L225 Difference]: With dead ends: 78 [2022-10-15 16:28:17,995 INFO L226 Difference]: Without dead ends: 78 [2022-10-15 16:28:17,996 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:28:17,997 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:17,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-15 16:28:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-10-15 16:28:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 77 states have internal predecessors, (82), 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:28:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-10-15 16:28:18,005 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 7 [2022-10-15 16:28:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:18,005 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-10-15 16:28:18,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:28:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-10-15 16:28:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:28:18,006 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:18,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:18,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:28:18,007 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:18,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:18,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1805087526, now seen corresponding path program 1 times [2022-10-15 16:28:18,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:18,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45211715] [2022-10-15 16:28:18,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:18,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:18,142 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:28:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:18,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45211715] [2022-10-15 16:28:18,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45211715] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:18,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:18,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:28:18,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426114546] [2022-10-15 16:28:18,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:18,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:28:18,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:18,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:28:18,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:28:18,146 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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:28:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:18,288 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-10-15 16:28:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:28:18,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-10-15 16:28:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:18,290 INFO L225 Difference]: With dead ends: 82 [2022-10-15 16:28:18,290 INFO L226 Difference]: Without dead ends: 82 [2022-10-15 16:28:18,291 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:28:18,292 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:18,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-15 16:28:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-10-15 16:28:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 79 states have internal predecessors, (84), 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:28:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-10-15 16:28:18,299 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 7 [2022-10-15 16:28:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:18,299 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-10-15 16:28:18,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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:28:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-10-15 16:28:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 16:28:18,300 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:18,300 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:18,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:28:18,301 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash 514532585, now seen corresponding path program 1 times [2022-10-15 16:28:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:18,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634347599] [2022-10-15 16:28:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:18,562 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:28:18,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:18,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634347599] [2022-10-15 16:28:18,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634347599] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:18,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521446979] [2022-10-15 16:28:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:18,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:18,571 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:28:18,585 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:28:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:18,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 16:28:18,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:18,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:18,915 INFO L356 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-10-15 16:28:18,917 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:28:18,968 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 838 treesize of output 822 [2022-10-15 16:28:19,237 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:28:19,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:19,353 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:28:19,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521446979] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:19,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:19,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-10-15 16:28:19,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861817169] [2022-10-15 16:28:19,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:19,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:28:19,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:19,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:28:19,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:28:19,357 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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:28:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:19,835 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2022-10-15 16:28:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:28:19,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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:28:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:19,837 INFO L225 Difference]: With dead ends: 218 [2022-10-15 16:28:19,837 INFO L226 Difference]: Without dead ends: 218 [2022-10-15 16:28:19,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:28:19,843 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 134 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:19,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 289 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 16:28:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-10-15 16:28:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 84. [2022-10-15 16:28:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 83 states have internal predecessors, (89), 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:28:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-10-15 16:28:19,854 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 11 [2022-10-15 16:28:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:19,855 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-10-15 16:28:19,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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:28:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-10-15 16:28:19,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:28:19,856 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:19,856 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:19,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:20,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 16:28:20,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:20,073 INFO L85 PathProgramCache]: Analyzing trace with hash 544527257, now seen corresponding path program 1 times [2022-10-15 16:28:20,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:20,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22267917] [2022-10-15 16:28:20,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:20,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:20,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:20,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22267917] [2022-10-15 16:28:20,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22267917] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:20,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24788650] [2022-10-15 16:28:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:20,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:20,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:20,145 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:28:20,156 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:28:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:20,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:28:20,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:20,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:20,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24788650] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:20,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:20,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-15 16:28:20,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515310465] [2022-10-15 16:28:20,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:20,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:28:20,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:20,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:28:20,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:28:20,314 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:28:20,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:20,440 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-10-15 16:28:20,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:28:20,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 13 [2022-10-15 16:28:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:20,442 INFO L225 Difference]: With dead ends: 89 [2022-10-15 16:28:20,442 INFO L226 Difference]: Without dead ends: 89 [2022-10-15 16:28:20,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:28:20,447 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:20,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 116 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-15 16:28:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-10-15 16:28:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.6) internal successors, (88), 83 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:28:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-10-15 16:28:20,463 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 13 [2022-10-15 16:28:20,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:20,463 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-10-15 16:28:20,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:28:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-10-15 16:28:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:28:20,467 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:20,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:20,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:20,680 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,SelfDestructingSolverStorable6 [2022-10-15 16:28:20,681 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:20,682 INFO L85 PathProgramCache]: Analyzing trace with hash 544573770, now seen corresponding path program 1 times [2022-10-15 16:28:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:20,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043924042] [2022-10-15 16:28:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:20,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:20,834 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:28:20,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:20,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043924042] [2022-10-15 16:28:20,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043924042] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:20,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853331417] [2022-10-15 16:28:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:20,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:20,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:20,847 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:28:20,872 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:28:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:20,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 16:28:20,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:20,997 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-10-15 16:28:20,998 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:28:21,093 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:28:21,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:21,187 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:28:21,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853331417] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:21,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:21,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-10-15 16:28:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526577593] [2022-10-15 16:28:21,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:21,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:28:21,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:21,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:28:21,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:28:21,190 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 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:28:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:21,365 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-10-15 16:28:21,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:28:21,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 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 13 [2022-10-15 16:28:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:21,367 INFO L225 Difference]: With dead ends: 88 [2022-10-15 16:28:21,367 INFO L226 Difference]: Without dead ends: 88 [2022-10-15 16:28:21,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:28:21,369 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 12 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:21,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 155 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-10-15 16:28:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2022-10-15 16:28:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 85 states have internal predecessors, (90), 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:28:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-10-15 16:28:21,379 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 13 [2022-10-15 16:28:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:21,379 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-10-15 16:28:21,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.375) internal successors, (35), 9 states have internal predecessors, (35), 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:28:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-10-15 16:28:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:28:21,380 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:21,381 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-10-15 16:28:21,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-10-15 16:28:21,594 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:28:21,595 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:21,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:21,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1820952845, now seen corresponding path program 2 times [2022-10-15 16:28:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:21,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100660984] [2022-10-15 16:28:21,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:21,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:21,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:21,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100660984] [2022-10-15 16:28:21,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100660984] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:21,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050165998] [2022-10-15 16:28:21,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:28:21,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:21,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:21,819 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:28:21,833 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:28:21,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:28:21,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:28:21,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 16:28:21,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:21,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:21,969 INFO L356 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-10-15 16:28:21,969 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:28:21,989 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:28:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:22,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:22,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050165998] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:22,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:22,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-10-15 16:28:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485504662] [2022-10-15 16:28:22,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:22,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 16:28:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:22,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 16:28:22,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:28:22,418 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 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:28:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:22,925 INFO L93 Difference]: Finished difference Result 209 states and 219 transitions. [2022-10-15 16:28:22,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:28:22,926 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 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 17 [2022-10-15 16:28:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:22,927 INFO L225 Difference]: With dead ends: 209 [2022-10-15 16:28:22,927 INFO L226 Difference]: Without dead ends: 209 [2022-10-15 16:28:22,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:28:22,929 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 700 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:22,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 275 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 16:28:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-10-15 16:28:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 83. [2022-10-15 16:28:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 82 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:28:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-10-15 16:28:22,934 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 17 [2022-10-15 16:28:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:22,935 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-10-15 16:28:22,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 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:28:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-10-15 16:28:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:28:22,936 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:22,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2022-10-15 16:28:22,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-15 16:28:23,149 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:28:23,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1883993198, now seen corresponding path program 2 times [2022-10-15 16:28:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:23,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833008636] [2022-10-15 16:28:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:23,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:23,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833008636] [2022-10-15 16:28:23,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833008636] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:23,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78081925] [2022-10-15 16:28:23,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:28:23,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:23,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:23,332 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:28:23,345 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:28:23,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 16:28:23,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:28:23,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 16:28:23,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:23,457 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-10-15 16:28:23,458 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:28:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:28:23,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:28:23,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78081925] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:23,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:23,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-10-15 16:28:23,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436747772] [2022-10-15 16:28:23,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:23,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 16:28:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:23,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 16:28:23,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:28:23,892 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:24,565 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2022-10-15 16:28:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:28:24,565 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 16:28:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:24,568 INFO L225 Difference]: With dead ends: 205 [2022-10-15 16:28:24,569 INFO L226 Difference]: Without dead ends: 205 [2022-10-15 16:28:24,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-10-15 16:28:24,573 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 770 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:24,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 287 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 16:28:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-10-15 16:28:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 78. [2022-10-15 16:28:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 77 states have internal predecessors, (82), 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:28:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-10-15 16:28:24,583 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 19 [2022-10-15 16:28:24,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:24,584 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-10-15 16:28:24,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-10-15 16:28:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 16:28:24,584 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:24,585 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:24,610 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:28:24,785 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,SelfDestructingSolverStorable9 [2022-10-15 16:28:24,786 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1727194931, now seen corresponding path program 1 times [2022-10-15 16:28:24,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:24,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717540530] [2022-10-15 16:28:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:24,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:28:25,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:25,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717540530] [2022-10-15 16:28:25,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717540530] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:25,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:25,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:28:25,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781933942] [2022-10-15 16:28:25,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:25,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:28:25,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:25,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:28:25,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:28:25,128 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:28:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:25,165 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-10-15 16:28:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:28:25,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2022-10-15 16:28:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:25,166 INFO L225 Difference]: With dead ends: 72 [2022-10-15 16:28:25,166 INFO L226 Difference]: Without dead ends: 72 [2022-10-15 16:28:25,167 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:28:25,168 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:25,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:28:25,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-15 16:28:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-10-15 16:28:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 71 states have internal predecessors, (76), 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:28:25,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-10-15 16:28:25,171 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 20 [2022-10-15 16:28:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:25,172 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-10-15 16:28:25,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:28:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-10-15 16:28:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 16:28:25,173 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:25,173 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:25,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:28:25,173 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:25,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1727194930, now seen corresponding path program 1 times [2022-10-15 16:28:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:25,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728694472] [2022-10-15 16:28:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:28:25,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:25,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728694472] [2022-10-15 16:28:25,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728694472] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:25,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:25,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:28:25,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377345358] [2022-10-15 16:28:25,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:25,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:28:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:25,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:28:25,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:28:25,554 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:25,707 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2022-10-15 16:28:25,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:28:25,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 16:28:25,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:25,709 INFO L225 Difference]: With dead ends: 115 [2022-10-15 16:28:25,709 INFO L226 Difference]: Without dead ends: 115 [2022-10-15 16:28:25,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:28:25,710 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 101 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:25,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 67 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:25,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-10-15 16:28:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2022-10-15 16:28:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 86 states have internal predecessors, (95), 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:28:25,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-10-15 16:28:25,714 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 20 [2022-10-15 16:28:25,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:25,715 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-10-15 16:28:25,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:25,715 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-10-15 16:28:25,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 16:28:25,716 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:25,716 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:25,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:28:25,717 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:25,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1155971389, now seen corresponding path program 1 times [2022-10-15 16:28:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:25,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716964660] [2022-10-15 16:28:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:28:25,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:25,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716964660] [2022-10-15 16:28:25,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716964660] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:25,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:25,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:28:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458324397] [2022-10-15 16:28:25,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:25,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:28:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:28:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:28:25,928 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:26,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:26,031 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2022-10-15 16:28:26,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:28:26,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-15 16:28:26,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:26,033 INFO L225 Difference]: With dead ends: 110 [2022-10-15 16:28:26,033 INFO L226 Difference]: Without dead ends: 110 [2022-10-15 16:28:26,033 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:28:26,034 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 127 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:26,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 42 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-15 16:28:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2022-10-15 16:28:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.355263157894737) internal successors, (103), 93 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:28:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-10-15 16:28:26,039 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 23 [2022-10-15 16:28:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:26,039 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-10-15 16:28:26,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-10-15 16:28:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 16:28:26,040 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:26,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:26,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 16:28:26,041 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:26,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1155971390, now seen corresponding path program 1 times [2022-10-15 16:28:26,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:26,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204480401] [2022-10-15 16:28:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:26,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:28:26,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:26,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204480401] [2022-10-15 16:28:26,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204480401] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:26,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:26,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:28:26,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457396149] [2022-10-15 16:28:26,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:26,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:28:26,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:26,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:28:26,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:28:26,252 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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:28:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:26,284 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-10-15 16:28:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:28:26,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 23 [2022-10-15 16:28:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:26,285 INFO L225 Difference]: With dead ends: 89 [2022-10-15 16:28:26,285 INFO L226 Difference]: Without dead ends: 89 [2022-10-15 16:28:26,286 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:28:26,286 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:26,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 42 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:28:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-15 16:28:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-10-15 16:28:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 88 states have internal predecessors, (93), 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:28:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-10-15 16:28:26,290 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 23 [2022-10-15 16:28:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:26,291 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-10-15 16:28:26,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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:28:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-10-15 16:28:26,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 16:28:26,292 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:26,292 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:26,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:28:26,293 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash 199491685, now seen corresponding path program 1 times [2022-10-15 16:28:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:26,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938560290] [2022-10-15 16:28:26,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:28:26,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:26,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938560290] [2022-10-15 16:28:26,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938560290] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:26,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532610834] [2022-10-15 16:28:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:26,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:26,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:26,895 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:26,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 16:28:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:26,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-15 16:28:26,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:27,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:27,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:27,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:27,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:27,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:27,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:27,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2022-10-15 16:28:27,033 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-15 16:28:27,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2022-10-15 16:28:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:28:27,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:27,372 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:28:27,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532610834] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:27,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:27,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 11 [2022-10-15 16:28:27,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280877958] [2022-10-15 16:28:27,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:27,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 16:28:27,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:27,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 16:28:27,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:28:27,375 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:27,903 INFO L93 Difference]: Finished difference Result 147 states and 154 transitions. [2022-10-15 16:28:27,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:28:27,903 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-15 16:28:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:27,904 INFO L225 Difference]: With dead ends: 147 [2022-10-15 16:28:27,905 INFO L226 Difference]: Without dead ends: 147 [2022-10-15 16:28:27,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:28:27,906 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 489 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:27,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 95 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:28:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-10-15 16:28:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 105. [2022-10-15 16:28:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.2127659574468086) internal successors, (114), 104 states have internal predecessors, (114), 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:28:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2022-10-15 16:28:27,910 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 28 [2022-10-15 16:28:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:27,911 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2022-10-15 16:28:27,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2022-10-15 16:28:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 16:28:27,912 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:27,912 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:27,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:28,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 16:28:28,126 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:28,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1177967668, now seen corresponding path program 1 times [2022-10-15 16:28:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:28,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392210939] [2022-10-15 16:28:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:28:28,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:28,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392210939] [2022-10-15 16:28:28,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392210939] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:28,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462978697] [2022-10-15 16:28:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:28,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:28,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:28,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:28,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 16:28:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:28,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-15 16:28:28,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:28,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:28,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:28,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:28,757 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-10-15 16:28:28,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 31 [2022-10-15 16:28:28,775 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-15 16:28:28,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 144 [2022-10-15 16:28:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:28:28,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:28:29,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462978697] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:29,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:29,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-10-15 16:28:29,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189000954] [2022-10-15 16:28:29,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:29,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 16:28:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 16:28:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:28:29,162 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 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:28:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:29,537 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2022-10-15 16:28:29,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:28:29,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-10-15 16:28:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:29,539 INFO L225 Difference]: With dead ends: 140 [2022-10-15 16:28:29,539 INFO L226 Difference]: Without dead ends: 140 [2022-10-15 16:28:29,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:28:29,541 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 305 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:29,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 122 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:28:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-10-15 16:28:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 110. [2022-10-15 16:28:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 109 states have internal predecessors, (119), 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:28:29,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-10-15 16:28:29,546 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 31 [2022-10-15 16:28:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:29,546 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-10-15 16:28:29,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 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:28:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-10-15 16:28:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 16:28:29,547 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:29,548 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:29,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:29,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:29,761 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:29,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2101436668, now seen corresponding path program 2 times [2022-10-15 16:28:29,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:29,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018618604] [2022-10-15 16:28:29,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:29,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:29,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:29,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018618604] [2022-10-15 16:28:29,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018618604] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:29,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451265309] [2022-10-15 16:28:29,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:28:29,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:29,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:29,931 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:29,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 16:28:30,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 16:28:30,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:28:30,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 21 conjunts are in the unsatisfiable core [2022-10-15 16:28:30,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:30,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:30,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:30,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:30,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:30,064 INFO L356 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2022-10-15 16:28:30,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 31 [2022-10-15 16:28:30,078 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-15 16:28:30,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-10-15 16:28:30,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 16:28:30,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 16:28:31,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451265309] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:31,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:31,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 15 [2022-10-15 16:28:31,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062667427] [2022-10-15 16:28:31,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:31,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-15 16:28:31,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-15 16:28:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:28:31,071 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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:28:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:32,295 INFO L93 Difference]: Finished difference Result 248 states and 258 transitions. [2022-10-15 16:28:32,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-15 16:28:32,296 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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 36 [2022-10-15 16:28:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:32,298 INFO L225 Difference]: With dead ends: 248 [2022-10-15 16:28:32,298 INFO L226 Difference]: Without dead ends: 248 [2022-10-15 16:28:32,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=431, Invalid=1549, Unknown=0, NotChecked=0, Total=1980 [2022-10-15 16:28:32,302 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 718 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:32,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 176 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 333 Invalid, 0 Unknown, 92 Unchecked, 0.4s Time] [2022-10-15 16:28:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-10-15 16:28:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 176. [2022-10-15 16:28:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 168 states have (on average 1.1369047619047619) internal successors, (191), 175 states have internal predecessors, (191), 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:28:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 191 transitions. [2022-10-15 16:28:32,314 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 191 transitions. Word has length 36 [2022-10-15 16:28:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:32,315 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 191 transitions. [2022-10-15 16:28:32,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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:28:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2022-10-15 16:28:32,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-15 16:28:32,322 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:32,322 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:32,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:32,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 16:28:32,536 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash 345075193, now seen corresponding path program 2 times [2022-10-15 16:28:32,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:32,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111276279] [2022-10-15 16:28:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:33,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:33,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111276279] [2022-10-15 16:28:33,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111276279] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:33,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179582194] [2022-10-15 16:28:33,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:28:33,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:33,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:33,114 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:33,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 16:28:33,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 16:28:33,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:28:33,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 16:28:33,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:33,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:33,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:33,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:33,259 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-10-15 16:28:33,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 31 [2022-10-15 16:28:33,279 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-15 16:28:33,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 92 [2022-10-15 16:28:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-15 16:28:33,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:34,193 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-15 16:28:34,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179582194] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:34,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:34,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 14 [2022-10-15 16:28:34,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158696114] [2022-10-15 16:28:34,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:34,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-15 16:28:34,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:34,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-15 16:28:34,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:28:34,196 INFO L87 Difference]: Start difference. First operand 176 states and 191 transitions. Second operand has 15 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 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:28:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:35,265 INFO L93 Difference]: Finished difference Result 329 states and 349 transitions. [2022-10-15 16:28:35,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:28:35,266 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 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 45 [2022-10-15 16:28:35,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:35,268 INFO L225 Difference]: With dead ends: 329 [2022-10-15 16:28:35,268 INFO L226 Difference]: Without dead ends: 329 [2022-10-15 16:28:35,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2022-10-15 16:28:35,269 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 574 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:35,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 374 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 16:28:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-10-15 16:28:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 166. [2022-10-15 16:28:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.124223602484472) internal successors, (181), 165 states have internal predecessors, (181), 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:28:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 181 transitions. [2022-10-15 16:28:35,277 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 181 transitions. Word has length 45 [2022-10-15 16:28:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:35,277 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 181 transitions. [2022-10-15 16:28:35,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 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:28:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 181 transitions. [2022-10-15 16:28:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-10-15 16:28:35,278 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:35,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:35,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:35,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 16:28:35,493 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1001242563, now seen corresponding path program 1 times [2022-10-15 16:28:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:35,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393168143] [2022-10-15 16:28:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 16:28:35,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:35,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393168143] [2022-10-15 16:28:35,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393168143] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:35,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101785344] [2022-10-15 16:28:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:35,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:35,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:35,624 INFO L229 MonitoredProcess]: Starting monitored process 11 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:28:35,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 16:28:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:35,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:28:35,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 16:28:35,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 16:28:35,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101785344] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:35,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:35,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-10-15 16:28:35,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018244198] [2022-10-15 16:28:35,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:35,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:28:35,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:35,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:28:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:28:35,849 INFO L87 Difference]: Start difference. First operand 166 states and 181 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 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:28:36,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:36,019 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2022-10-15 16:28:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:28:36,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 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 53 [2022-10-15 16:28:36,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:36,021 INFO L225 Difference]: With dead ends: 166 [2022-10-15 16:28:36,021 INFO L226 Difference]: Without dead ends: 166 [2022-10-15 16:28:36,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:28:36,022 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 192 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:36,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 65 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-10-15 16:28:36,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 144. [2022-10-15 16:28:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.1007194244604317) internal successors, (153), 143 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2022-10-15 16:28:36,029 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 53 [2022-10-15 16:28:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:36,029 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2022-10-15 16:28:36,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 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:28:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2022-10-15 16:28:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-10-15 16:28:36,030 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:36,030 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:36,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:36,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:36,245 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:36,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:36,246 INFO L85 PathProgramCache]: Analyzing trace with hash -540956777, now seen corresponding path program 1 times [2022-10-15 16:28:36,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:36,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756431897] [2022-10-15 16:28:36,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:36,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 16:28:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:36,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756431897] [2022-10-15 16:28:36,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756431897] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:36,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654028828] [2022-10-15 16:28:36,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:36,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:36,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:36,422 INFO L229 MonitoredProcess]: Starting monitored process 12 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:28:36,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-15 16:28:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:36,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 16:28:36,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 16:28:36,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-15 16:28:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654028828] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:36,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:36,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-10-15 16:28:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899023835] [2022-10-15 16:28:36,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:36,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 16:28:36,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:36,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 16:28:36,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:28:36,754 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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:28:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:37,085 INFO L93 Difference]: Finished difference Result 255 states and 262 transitions. [2022-10-15 16:28:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:28:37,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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 53 [2022-10-15 16:28:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:37,087 INFO L225 Difference]: With dead ends: 255 [2022-10-15 16:28:37,087 INFO L226 Difference]: Without dead ends: 255 [2022-10-15 16:28:37,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 95 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:28:37,089 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 420 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:37,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 158 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:28:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-10-15 16:28:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 195. [2022-10-15 16:28:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.0842105263157895) internal successors, (206), 194 states have internal predecessors, (206), 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:28:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 206 transitions. [2022-10-15 16:28:37,095 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 206 transitions. Word has length 53 [2022-10-15 16:28:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:37,095 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 206 transitions. [2022-10-15 16:28:37,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 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:28:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 206 transitions. [2022-10-15 16:28:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 16:28:37,096 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:37,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:37,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:37,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:37,311 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash 149807620, now seen corresponding path program 2 times [2022-10-15 16:28:37,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:37,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420503018] [2022-10-15 16:28:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:37,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 16:28:37,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:37,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420503018] [2022-10-15 16:28:37,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420503018] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:37,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205255794] [2022-10-15 16:28:37,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:28:37,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:37,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:37,727 INFO L229 MonitoredProcess]: Starting monitored process 13 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:28:37,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-15 16:28:37,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:28:37,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:28:37,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 16:28:37,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 16:28:38,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:38,310 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:28:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 16:28:38,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205255794] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:38,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:38,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2022-10-15 16:28:38,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482912961] [2022-10-15 16:28:38,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:38,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-15 16:28:38,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:38,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-15 16:28:38,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2022-10-15 16:28:38,458 INFO L87 Difference]: Start difference. First operand 195 states and 206 transitions. Second operand has 28 states, 27 states have (on average 6.037037037037037) internal successors, (163), 28 states have internal predecessors, (163), 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:28:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:39,610 INFO L93 Difference]: Finished difference Result 254 states and 258 transitions. [2022-10-15 16:28:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-15 16:28:39,611 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 6.037037037037037) internal successors, (163), 28 states have internal predecessors, (163), 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 67 [2022-10-15 16:28:39,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:39,612 INFO L225 Difference]: With dead ends: 254 [2022-10-15 16:28:39,613 INFO L226 Difference]: Without dead ends: 236 [2022-10-15 16:28:39,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=444, Invalid=1448, Unknown=0, NotChecked=0, Total=1892 [2022-10-15 16:28:39,615 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 896 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:39,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 525 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 16:28:39,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-10-15 16:28:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 204. [2022-10-15 16:28:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.07035175879397) internal successors, (213), 203 states have internal predecessors, (213), 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:28:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 213 transitions. [2022-10-15 16:28:39,621 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 213 transitions. Word has length 67 [2022-10-15 16:28:39,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:39,621 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 213 transitions. [2022-10-15 16:28:39,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 6.037037037037037) internal successors, (163), 28 states have internal predecessors, (163), 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:28:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 213 transitions. [2022-10-15 16:28:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-10-15 16:28:39,623 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:39,623 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:39,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-10-15 16:28:39,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-10-15 16:28:39,836 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:39,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash 417948493, now seen corresponding path program 3 times [2022-10-15 16:28:39,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:39,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540355861] [2022-10-15 16:28:39,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:39,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 13 proven. 38 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-15 16:28:40,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:40,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540355861] [2022-10-15 16:28:40,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540355861] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:40,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592322004] [2022-10-15 16:28:40,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 16:28:40,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:40,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:40,084 INFO L229 MonitoredProcess]: Starting monitored process 14 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:28:40,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-15 16:28:40,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-10-15 16:28:40,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:28:40,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 16:28:40,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-15 16:28:40,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 13 proven. 18 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-10-15 16:28:40,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592322004] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:40,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:40,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 23 [2022-10-15 16:28:40,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602875204] [2022-10-15 16:28:40,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:40,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-15 16:28:40,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:40,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-15 16:28:40,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-10-15 16:28:40,641 INFO L87 Difference]: Start difference. First operand 204 states and 213 transitions. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 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:28:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:41,884 INFO L93 Difference]: Finished difference Result 392 states and 400 transitions. [2022-10-15 16:28:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-15 16:28:41,885 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 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 75 [2022-10-15 16:28:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:41,888 INFO L225 Difference]: With dead ends: 392 [2022-10-15 16:28:41,888 INFO L226 Difference]: Without dead ends: 392 [2022-10-15 16:28:41,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=568, Invalid=1784, Unknown=0, NotChecked=0, Total=2352 [2022-10-15 16:28:41,891 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2208 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:41,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 236 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-15 16:28:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-10-15 16:28:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 314. [2022-10-15 16:28:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 312 states have (on average 1.0512820512820513) internal successors, (328), 313 states have internal predecessors, (328), 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:28:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 328 transitions. [2022-10-15 16:28:41,900 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 328 transitions. Word has length 75 [2022-10-15 16:28:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:41,901 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 328 transitions. [2022-10-15 16:28:41,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 23 states have internal predecessors, (126), 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:28:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 328 transitions. [2022-10-15 16:28:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-15 16:28:41,902 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:41,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:41,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:42,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-15 16:28:42,116 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-10-15 16:28:42,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:42,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1952215208, now seen corresponding path program 2 times [2022-10-15 16:28:42,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:42,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516700220] [2022-10-15 16:28:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:46,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:46,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516700220] [2022-10-15 16:28:46,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516700220] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:46,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078354935] [2022-10-15 16:28:46,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:28:46,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:46,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:46,193 INFO L229 MonitoredProcess]: Starting monitored process 15 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:28:46,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-15 16:28:46,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:28:46,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:28:46,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 73 conjunts are in the unsatisfiable core [2022-10-15 16:28:46,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:46,381 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-10-15 16:28:46,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 121 [2022-10-15 16:28:46,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-15 16:28:46,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:28:46,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-10-15 16:28:47,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2022-10-15 16:28:47,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:47,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-10-15 16:28:47,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-10-15 16:28:47,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2022-10-15 16:28:47,722 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 31 treesize of output 19 [2022-10-15 16:28:47,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-10-15 16:28:48,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-10-15 16:28:48,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:48,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-10-15 16:28:48,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-10-15 16:28:48,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2022-10-15 16:28:48,672 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 15 treesize of output 11 [2022-10-15 16:28:48,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:28:48,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-10-15 16:28:49,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-10-15 16:28:49,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 10 [2022-10-15 16:28:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:49,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:49,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))))) is different from false [2022-10-15 16:28:49,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-15 16:28:49,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_156| Int)) (or (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_156|)))) is different from false [2022-10-15 16:28:49,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1108 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_156|)) (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-10-15 16:28:49,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1108 Int)) (or (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) |c_ULTIMATE.start_main_#t~mem20#1|)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_156|)))) is different from false [2022-10-15 16:28:49,564 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1108 Int)) (or (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_156|)))) is different from false [2022-10-15 16:28:49,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1108 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) is different from false [2022-10-15 16:28:49,655 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1102 Int) (v_ArrVal_1108 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-10-15 16:28:49,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1108 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) is different from false [2022-10-15 16:28:49,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_159| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_159|)) (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1108 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))))) is different from false [2022-10-15 16:28:49,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1108 Int)) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |c_ULTIMATE.start_main_~tmp~0#1|)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_159|)))) is different from false [2022-10-15 16:28:49,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1108 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |c_ULTIMATE.start_main_~tmp~0#1|))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_159|)))) is different from false [2022-10-15 16:28:49,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1108 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_159|)) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |c_ULTIMATE.start_main_#t~mem16#1|))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) is different from false [2022-10-15 16:28:49,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1108 Int)) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_159|)))) is different from false [2022-10-15 16:28:50,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1108 Int)) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_159|)))) is different from false [2022-10-15 16:28:50,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1108 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_159|)) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1097))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) is different from false [2022-10-15 16:28:50,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1095 Int) (v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1108 Int)) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1095)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1097))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_159|)))) is different from false [2022-10-15 16:28:50,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_162| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_162|)) (forall ((v_ArrVal_1095 Int) (v_ArrVal_1109 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (v_ArrVal_1106 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1108 Int)) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_162| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1095)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1097))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_159|)))))) is different from false [2022-10-15 16:28:50,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1101 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_162| Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1094 (Array Int Int)) (v_ArrVal_1095 Int) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1102 Int) (v_ArrVal_1108 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_162|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (let ((.cse6 (store (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1094))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_162| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1095))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1097))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_159|)))) is different from false [2022-10-15 16:28:50,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1101 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_162| Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1094 (Array Int Int)) (v_ArrVal_1095 Int) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1102 Int) (v_ArrVal_1108 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_162|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (let ((.cse6 (store (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) |c_ULTIMATE.start_main_#t~mem13#1|)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1094))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_162| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1095))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1097))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_159|)))) is different from false [2022-10-15 16:28:50,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1101 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_162| Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1094 (Array Int Int)) (v_ArrVal_1095 Int) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1102 Int) (v_ArrVal_1108 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_162|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (let ((.cse1 (* 4 c_~SIZE~0))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse5 (store (let ((.cse7 (store (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* (- 4) |c_ULTIMATE.start_main_~i~0#1|) (- 4) .cse1)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1094))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_162| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1095))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1097))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse6 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse4))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) .cse1))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_159|)))) is different from false [2022-10-15 16:28:50,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1101 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_162| Int) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1097 (Array Int Int)) (v_ArrVal_1094 (Array Int Int)) (v_ArrVal_1095 Int) (|v_ULTIMATE.start_main_~i~0#1_159| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_1102 Int) (v_ArrVal_1108 Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse5 (store (let ((.cse7 (store (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1094))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_162| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1095))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1097))) (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1098))) (store .cse6 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1101))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_159| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1102))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse4))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1106))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1108))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1109))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse1)))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_156|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_159|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_162|)))) is different from false [2022-10-15 16:28:51,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:28:51,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 9350 treesize of output 5043