/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/condg.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:19:26,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:19:26,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:19:26,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:19:26,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:19:26,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:19:26,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:19:26,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:19:26,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:19:26,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:19:26,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:19:26,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:19:26,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:19:26,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:19:26,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:19:26,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:19:26,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:19:26,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:19:26,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:19:26,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:19:26,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:19:26,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:19:26,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:19:26,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:19:26,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:19:26,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:19:26,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:19:26,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:19:26,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:19:26,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:19:26,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:19:26,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:19:26,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:19:26,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:19:26,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:19:26,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:19:26,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:19:26,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:19:26,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:19:26,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:19:26,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:19:26,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 23:19:26,973 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:19:26,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:19:26,973 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:19:26,973 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:19:26,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:19:26,974 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:19:26,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:19:26,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:19:26,975 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:19:26,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:19:26,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:19:26,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:19:26,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:19:26,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:19:26,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:19:26,976 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:19:26,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:19:26,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:19:26,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:19:26,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:19:26,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:19:26,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:19:26,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:19:26,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:19:26,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:19:26,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:19:26,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:19:26,978 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:19:26,978 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:19:26,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:19:26,978 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-09 23:19:27,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:19:27,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:19:27,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:19:27,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:19:27,153 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:19:27,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condg.c [2022-01-09 23:19:27,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce500cc49/76098aa4cb4d4da6aefa21a48c69e3a5/FLAGcc494b2c8 [2022-01-09 23:19:27,491 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:19:27,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condg.c [2022-01-09 23:19:27,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce500cc49/76098aa4cb4d4da6aefa21a48c69e3a5/FLAGcc494b2c8 [2022-01-09 23:19:27,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce500cc49/76098aa4cb4d4da6aefa21a48c69e3a5 [2022-01-09 23:19:27,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:19:27,920 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:19:27,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:19:27,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:19:27,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:19:27,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:19:27" (1/1) ... [2022-01-09 23:19:27,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0fef9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:27, skipping insertion in model container [2022-01-09 23:19:27,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:19:27" (1/1) ... [2022-01-09 23:19:27,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:19:27,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:19:28,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condg.c[588,601] [2022-01-09 23:19:28,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:19:28,045 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:19:28,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condg.c[588,601] [2022-01-09 23:19:28,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:19:28,102 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:19:28,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28 WrapperNode [2022-01-09 23:19:28,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:19:28,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:19:28,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:19:28,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:19:28,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (1/1) ... [2022-01-09 23:19:28,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (1/1) ... [2022-01-09 23:19:28,145 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-01-09 23:19:28,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:19:28,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:19:28,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:19:28,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:19:28,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (1/1) ... [2022-01-09 23:19:28,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (1/1) ... [2022-01-09 23:19:28,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (1/1) ... [2022-01-09 23:19:28,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (1/1) ... [2022-01-09 23:19:28,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (1/1) ... [2022-01-09 23:19:28,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (1/1) ... [2022-01-09 23:19:28,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (1/1) ... [2022-01-09 23:19:28,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:19:28,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:19:28,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:19:28,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:19:28,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (1/1) ... [2022-01-09 23:19:28,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:19:28,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:19:28,210 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-01-09 23:19:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:19:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:19:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-09 23:19:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-09 23:19:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-09 23:19:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:19:28,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:19:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-09 23:19:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-09 23:19:28,232 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-01-09 23:19:28,279 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:19:28,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:19:28,471 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:19:28,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:19:28,475 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-09 23:19:28,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:19:28 BoogieIcfgContainer [2022-01-09 23:19:28,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:19:28,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:19:28,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:19:28,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:19:28,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:19:27" (1/3) ... [2022-01-09 23:19:28,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd50335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:19:28, skipping insertion in model container [2022-01-09 23:19:28,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:19:28" (2/3) ... [2022-01-09 23:19:28,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd50335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:19:28, skipping insertion in model container [2022-01-09 23:19:28,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:19:28" (3/3) ... [2022-01-09 23:19:28,482 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2022-01-09 23:19:28,486 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:19:28,486 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:19:28,552 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:19:28,557 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-09 23:19:28,557 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:19:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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-01-09 23:19:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-09 23:19:28,571 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:19:28,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:19:28,572 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:19:28,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:19:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2022-01-09 23:19:28,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:19:28,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894026637] [2022-01-09 23:19:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:19:28,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:19:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:19:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:19:28,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:19:28,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894026637] [2022-01-09 23:19:28,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894026637] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:19:28,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:19:28,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-09 23:19:28,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019979265] [2022-01-09 23:19:28,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:19:28,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-09 23:19:28,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:19:28,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-09 23:19:28,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:19:28,759 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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-01-09 23:19:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:19:28,771 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-01-09 23:19:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-09 23:19:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-09 23:19:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:19:28,778 INFO L225 Difference]: With dead ends: 46 [2022-01-09 23:19:28,778 INFO L226 Difference]: Without dead ends: 21 [2022-01-09 23:19:28,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:19:28,785 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:19:28,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:19:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-09 23:19:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-09 23:19:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:19:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-01-09 23:19:28,817 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-01-09 23:19:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:19:28,817 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-01-09 23:19:28,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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-01-09 23:19:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-01-09 23:19:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-09 23:19:28,818 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:19:28,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:19:28,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:19:28,819 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:19:28,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:19:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2022-01-09 23:19:28,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:19:28,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133038962] [2022-01-09 23:19:28,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:19:28,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:19:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:19:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:19:28,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:19:28,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133038962] [2022-01-09 23:19:28,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133038962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:19:28,916 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:19:28,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:19:28,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250751121] [2022-01-09 23:19:28,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:19:28,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:19:28,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:19:28,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:19:28,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:19:28,920 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-01-09 23:19:28,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:19:28,987 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-01-09 23:19:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:19:28,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-09 23:19:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:19:28,988 INFO L225 Difference]: With dead ends: 48 [2022-01-09 23:19:28,989 INFO L226 Difference]: Without dead ends: 34 [2022-01-09 23:19:28,992 INFO L932 BasicCegarLoop]: 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-01-09 23:19:28,993 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:19:28,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:19:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-09 23:19:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2022-01-09 23:19:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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-01-09 23:19:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-09 23:19:29,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2022-01-09 23:19:29,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:19:29,003 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-09 23:19:29,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-01-09 23:19:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-09 23:19:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-09 23:19:29,005 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:19:29,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:19:29,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:19:29,005 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:19:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:19:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2022-01-09 23:19:29,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:19:29,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281184984] [2022-01-09 23:19:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:19:29,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:19:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:19:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:19:29,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:19:29,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281184984] [2022-01-09 23:19:29,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281184984] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:19:29,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430164589] [2022-01-09 23:19:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:19:29,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:19:29,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:19:29,320 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-01-09 23:19:29,321 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-01-09 23:19:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:19:29,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 26 conjunts are in the unsatisfiable core [2022-01-09 23:19:29,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:19:29,446 INFO L387 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 10 treesize of output 8 [2022-01-09 23:19:29,477 INFO L387 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 18 treesize of output 14 [2022-01-09 23:19:29,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:19:29,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 20 [2022-01-09 23:19:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:19:29,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:19:29,708 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_44 (Array Int Int))) (= (+ (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_44) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0)) is different from false [2022-01-09 23:19:29,744 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:19:29,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-01-09 23:19:29,764 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:19:29,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-01-09 23:19:29,768 INFO L387 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 11 treesize of output 9 [2022-01-09 23:19:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-09 23:19:29,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430164589] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:19:29,807 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:19:29,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-01-09 23:19:29,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200351217] [2022-01-09 23:19:29,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:19:29,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-09 23:19:29,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:19:29,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-09 23:19:29,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2022-01-09 23:19:29,812 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 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-01-09 23:19:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:19:30,023 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-01-09 23:19:30,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-09 23:19:30,024 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 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 21 [2022-01-09 23:19:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:19:30,024 INFO L225 Difference]: With dead ends: 56 [2022-01-09 23:19:30,025 INFO L226 Difference]: Without dead ends: 54 [2022-01-09 23:19:30,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=370, Unknown=1, NotChecked=40, Total=506 [2022-01-09 23:19:30,026 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:19:30,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 96 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 158 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-01-09 23:19:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-09 23:19:30,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2022-01-09 23:19:30,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 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-01-09 23:19:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-01-09 23:19:30,030 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2022-01-09 23:19:30,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:19:30,031 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-01-09 23:19:30,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 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-01-09 23:19:30,031 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-01-09 23:19:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-09 23:19:30,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:19:30,031 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:19:30,050 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-01-09 23:19:30,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:19:30,247 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:19:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:19:30,247 INFO L85 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2022-01-09 23:19:30,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:19:30,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64564816] [2022-01-09 23:19:30,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:19:30,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:19:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:19:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:19:30,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:19:30,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64564816] [2022-01-09 23:19:30,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64564816] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:19:30,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815939949] [2022-01-09 23:19:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:19:30,476 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:19:30,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:19:30,477 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-01-09 23:19:30,478 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-01-09 23:19:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:19:30,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-09 23:19:30,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:19:30,547 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:19:30,552 INFO L387 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 10 treesize of output 8 [2022-01-09 23:19:30,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-09 23:19:30,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 [2022-01-09 23:19:30,773 INFO L387 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 26 treesize of output 10 [2022-01-09 23:19:30,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:19:30,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:19:30,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:19:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:19:30,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815939949] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:19:30,914 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:19:30,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-01-09 23:19:30,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189670467] [2022-01-09 23:19:30,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:19:30,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-09 23:19:30,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:19:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-09 23:19:30,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-01-09 23:19:30,916 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 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-01-09 23:19:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:19:31,104 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-01-09 23:19:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:19:31,104 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 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 21 [2022-01-09 23:19:31,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:19:31,105 INFO L225 Difference]: With dead ends: 66 [2022-01-09 23:19:31,105 INFO L226 Difference]: Without dead ends: 56 [2022-01-09 23:19:31,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-01-09 23:19:31,106 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:19:31,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 171 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-01-09 23:19:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-09 23:19:31,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-01-09 23:19:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 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-01-09 23:19:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-01-09 23:19:31,110 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 21 [2022-01-09 23:19:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:19:31,111 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-01-09 23:19:31,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 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-01-09 23:19:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-01-09 23:19:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-09 23:19:31,111 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:19:31,111 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:19:31,138 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-01-09 23:19:31,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-09 23:19:31,312 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:19:31,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:19:31,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1912499326, now seen corresponding path program 2 times [2022-01-09 23:19:31,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:19:31,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128586973] [2022-01-09 23:19:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:19:31,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:19:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:19:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:19:31,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:19:31,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128586973] [2022-01-09 23:19:31,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128586973] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:19:31,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561477216] [2022-01-09 23:19:31,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:19:31,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:19:31,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:19:31,365 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-01-09 23:19:31,379 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-01-09 23:19:31,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:19:31,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:19:31,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 23:19:31,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:19:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:19:31,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:19:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:19:31,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561477216] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:19:31,523 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:19:31,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-01-09 23:19:31,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860318038] [2022-01-09 23:19:31,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:19:31,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:19:31,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:19:31,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:19:31,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:19:31,524 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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-01-09 23:19:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:19:31,718 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2022-01-09 23:19:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 23:19:31,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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-01-09 23:19:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:19:31,722 INFO L225 Difference]: With dead ends: 93 [2022-01-09 23:19:31,722 INFO L226 Difference]: Without dead ends: 55 [2022-01-09 23:19:31,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:19:31,724 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 161 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:19:31,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 82 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:19:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-09 23:19:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-01-09 23:19:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 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-01-09 23:19:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-01-09 23:19:31,733 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2022-01-09 23:19:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:19:31,733 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-01-09 23:19:31,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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-01-09 23:19:31,733 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-01-09 23:19:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-09 23:19:31,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:19:31,734 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:19:31,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-09 23:19:31,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:19:31,939 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:19:31,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:19:31,940 INFO L85 PathProgramCache]: Analyzing trace with hash 550852762, now seen corresponding path program 1 times [2022-01-09 23:19:31,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:19:31,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782180387] [2022-01-09 23:19:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:19:31,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:19:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:19:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-09 23:19:31,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:19:31,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782180387] [2022-01-09 23:19:31,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782180387] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:19:31,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416006505] [2022-01-09 23:19:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:19:31,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:19:31,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:19:31,992 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-01-09 23:19:31,993 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-01-09 23:19:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:19:32,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-09 23:19:32,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:19:32,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:19:32,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:19:32,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-01-09 23:19:32,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-09 23:19:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-09 23:19:32,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:19:32,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-01-09 23:19:32,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_151 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_151) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-01-09 23:19:32,165 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:19:32,165 INFO L387 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 18 treesize of output 19 [2022-01-09 23:19:32,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-09 23:19:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 5 not checked. [2022-01-09 23:19:32,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416006505] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:19:32,186 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:19:32,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2022-01-09 23:19:32,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604655106] [2022-01-09 23:19:32,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:19:32,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:19:32,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:19:32,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:19:32,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-01-09 23:19:32,187 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-01-09 23:19:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:19:32,246 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-01-09 23:19:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:19:32,247 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-01-09 23:19:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:19:32,247 INFO L225 Difference]: With dead ends: 50 [2022-01-09 23:19:32,247 INFO L226 Difference]: Without dead ends: 40 [2022-01-09 23:19:32,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2022-01-09 23:19:32,248 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:19:32,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-01-09 23:19:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-09 23:19:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-01-09 23:19:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 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-01-09 23:19:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-01-09 23:19:32,252 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 28 [2022-01-09 23:19:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:19:32,252 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-01-09 23:19:32,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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-01-09 23:19:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-01-09 23:19:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-09 23:19:32,253 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:19:32,253 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:19:32,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-09 23:19:32,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:19:32,470 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:19:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:19:32,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1969107172, now seen corresponding path program 3 times [2022-01-09 23:19:32,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:19:32,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59959195] [2022-01-09 23:19:32,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:19:32,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:19:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:19:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:19:32,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:19:32,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59959195] [2022-01-09 23:19:32,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59959195] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:19:32,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958876721] [2022-01-09 23:19:32,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-09 23:19:32,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:19:32,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:19:32,998 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-01-09 23:19:32,999 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-01-09 23:19:33,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-09 23:19:33,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:19:33,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-09 23:19:33,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:19:33,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:19:33,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:19:33,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-09 23:19:33,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:19:33,164 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-09 23:19:33,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-01-09 23:19:33,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:19:33,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:19:33,351 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-09 23:19:33,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 41 [2022-01-09 23:19:33,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:19:33,462 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-01-09 23:19:33,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 48 [2022-01-09 23:19:33,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:19:33,812 INFO L353 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-01-09 23:19:33,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-01-09 23:19:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:19:33,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:19:59,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (not (<= |v_ULTIMATE.start_main_~i~0#1_72| (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (not (<= |v_ULTIMATE.start_main_~i~0#1_69| 1)) (let ((.cse1 (<= |v_ULTIMATE.start_main_~i~0#1_69| 0)) (.cse2 (<= |v_ULTIMATE.start_main_~i~0#1_72| 0)) (.cse0 (let ((.cse7 (store (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|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_72| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse6))))))) (and (or (<= .cse0 2) .cse1 .cse2) (or .cse1 .cse2 (<= (+ |v_ULTIMATE.start_main_~i~0#1_69| 1) .cse0)))))) is different from false [2022-01-09 23:19:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-09 23:19:59,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958876721] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:19:59,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:19:59,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 46 [2022-01-09 23:19:59,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574606975] [2022-01-09 23:19:59,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:19:59,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-09 23:19:59,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:19:59,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-09 23:19:59,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1687, Unknown=15, NotChecked=86, Total=2070 [2022-01-09 23:19:59,746 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 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-01-09 23:20:00,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:20:00,440 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2022-01-09 23:20:00,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-09 23:20:00,441 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 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-01-09 23:20:00,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:20:00,442 INFO L225 Difference]: With dead ends: 77 [2022-01-09 23:20:00,442 INFO L226 Difference]: Without dead ends: 62 [2022-01-09 23:20:00,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=428, Invalid=2753, Unknown=15, NotChecked=110, Total=3306 [2022-01-09 23:20:00,444 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 264 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:20:00,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 163 Invalid, 0 Unknown, 264 Unchecked, 0.1s Time] [2022-01-09 23:20:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-09 23:20:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2022-01-09 23:20:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 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-01-09 23:20:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-01-09 23:20:00,449 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 28 [2022-01-09 23:20:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:20:00,449 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-01-09 23:20:00,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 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-01-09 23:20:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-01-09 23:20:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-09 23:20:00,450 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:20:00,450 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:20:00,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-09 23:20:00,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:00,671 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:20:00,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:20:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1202810022, now seen corresponding path program 4 times [2022-01-09 23:20:00,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:20:00,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855446534] [2022-01-09 23:20:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:20:00,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:20:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:20:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-09 23:20:00,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:20:00,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855446534] [2022-01-09 23:20:00,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855446534] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:20:00,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399276742] [2022-01-09 23:20:00,721 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-09 23:20:00,721 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:00,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:20:00,722 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-01-09 23:20:00,723 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-01-09 23:20:00,766 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-09 23:20:00,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:20:00,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-09 23:20:00,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:20:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-09 23:20:00,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:20:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-09 23:20:00,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399276742] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:20:00,888 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:20:00,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-01-09 23:20:00,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994080557] [2022-01-09 23:20:00,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:20:00,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:20:00,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:20:00,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:20:00,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:20:00,889 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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-01-09 23:20:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:20:01,013 INFO L93 Difference]: Finished difference Result 140 states and 164 transitions. [2022-01-09 23:20:01,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-09 23:20:01,013 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-09 23:20:01,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:20:01,014 INFO L225 Difference]: With dead ends: 140 [2022-01-09 23:20:01,014 INFO L226 Difference]: Without dead ends: 111 [2022-01-09 23:20:01,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:20:01,015 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 153 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:20:01,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 61 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:20:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-01-09 23:20:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2022-01-09 23:20:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 82 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:20:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2022-01-09 23:20:01,023 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 30 [2022-01-09 23:20:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:20:01,023 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2022-01-09 23:20:01,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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-01-09 23:20:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-01-09 23:20:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 23:20:01,024 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:20:01,024 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:20:01,047 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-01-09 23:20:01,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:01,241 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:20:01,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:20:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash -736332014, now seen corresponding path program 1 times [2022-01-09 23:20:01,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:20:01,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110572518] [2022-01-09 23:20:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:20:01,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:20:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:20:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:20:01,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:20:01,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110572518] [2022-01-09 23:20:01,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110572518] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:20:01,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012485345] [2022-01-09 23:20:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:20:01,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:01,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:20:01,717 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-01-09 23:20:01,718 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-01-09 23:20:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:20:01,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-09 23:20:01,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:20:01,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:20:01,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:01,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-09 23:20:01,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:01,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:01,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-09 23:20:01,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:20:01,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:01,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:01,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-01-09 23:20:02,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:02,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:02,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-09 23:20:02,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:02,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:02,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:20:02,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2022-01-09 23:20:02,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:02,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 40 treesize of output 27 [2022-01-09 23:20:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:20:02,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:20:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:20:03,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012485345] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:20:03,161 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:20:03,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 50 [2022-01-09 23:20:03,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386999955] [2022-01-09 23:20:03,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:20:03,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-09 23:20:03,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:20:03,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-09 23:20:03,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2182, Unknown=0, NotChecked=0, Total=2450 [2022-01-09 23:20:03,163 INFO L87 Difference]: Start difference. First operand 83 states and 98 transitions. Second operand has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 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-01-09 23:20:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:20:04,124 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2022-01-09 23:20:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-09 23:20:04,124 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 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) Word has length 32 [2022-01-09 23:20:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:20:04,125 INFO L225 Difference]: With dead ends: 109 [2022-01-09 23:20:04,125 INFO L226 Difference]: Without dead ends: 90 [2022-01-09 23:20:04,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=640, Invalid=4190, Unknown=0, NotChecked=0, Total=4830 [2022-01-09 23:20:04,126 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 45 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:20:04,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 263 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 332 Invalid, 0 Unknown, 178 Unchecked, 0.2s Time] [2022-01-09 23:20:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-09 23:20:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2022-01-09 23:20:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:20:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-01-09 23:20:04,134 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 32 [2022-01-09 23:20:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:20:04,134 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-01-09 23:20:04,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.7) internal successors, (85), 50 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-01-09 23:20:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-01-09 23:20:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 23:20:04,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:20:04,137 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:20:04,155 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-01-09 23:20:04,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:04,355 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:20:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:20:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash -35267436, now seen corresponding path program 1 times [2022-01-09 23:20:04,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:20:04,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389711044] [2022-01-09 23:20:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:20:04,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:20:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:20:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-09 23:20:04,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:20:04,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389711044] [2022-01-09 23:20:04,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389711044] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:20:04,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920936364] [2022-01-09 23:20:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:20:04,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:04,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:20:04,403 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-01-09 23:20:04,404 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-01-09 23:20:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:20:04,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-09 23:20:04,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:20:04,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:20:04,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:04,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:20:04,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-09 23:20:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-09 23:20:04,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:20:04,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-01-09 23:20:04,541 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-01-09 23:20:04,550 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:20:04,551 INFO L387 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 18 treesize of output 19 [2022-01-09 23:20:04,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-09 23:20:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2022-01-09 23:20:04,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920936364] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:20:04,569 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:20:04,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2022-01-09 23:20:04,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524052125] [2022-01-09 23:20:04,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:20:04,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:20:04,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:20:04,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:20:04,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-01-09 23:20:04,570 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 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-01-09 23:20:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:20:04,621 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2022-01-09 23:20:04,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:20:04,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 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 32 [2022-01-09 23:20:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:20:04,622 INFO L225 Difference]: With dead ends: 102 [2022-01-09 23:20:04,622 INFO L226 Difference]: Without dead ends: 69 [2022-01-09 23:20:04,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=79, Unknown=2, NotChecked=38, Total=156 [2022-01-09 23:20:04,623 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:20:04,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2022-01-09 23:20:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-09 23:20:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-01-09 23:20:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.161764705882353) internal successors, (79), 68 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-01-09 23:20:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-01-09 23:20:04,628 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 32 [2022-01-09 23:20:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:20:04,628 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-01-09 23:20:04,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 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-01-09 23:20:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-01-09 23:20:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 23:20:04,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:20:04,629 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:20:04,645 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-01-09 23:20:04,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-09 23:20:04,843 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:20:04,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:20:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash -767176616, now seen corresponding path program 5 times [2022-01-09 23:20:04,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:20:04,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268140794] [2022-01-09 23:20:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:20:04,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:20:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:20:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:20:04,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:20:04,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268140794] [2022-01-09 23:20:04,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268140794] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:20:04,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567097741] [2022-01-09 23:20:04,888 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-09 23:20:04,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:04,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:20:04,890 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-01-09 23:20:04,890 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-01-09 23:20:04,958 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-09 23:20:04,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:20:04,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-09 23:20:04,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:20:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:20:05,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:20:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:20:05,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567097741] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:20:05,085 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:20:05,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-01-09 23:20:05,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720318555] [2022-01-09 23:20:05,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:20:05,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:20:05,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:20:05,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:20:05,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:20:05,086 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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-01-09 23:20:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:20:05,207 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2022-01-09 23:20:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-09 23:20:05,207 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-09 23:20:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:20:05,207 INFO L225 Difference]: With dead ends: 92 [2022-01-09 23:20:05,207 INFO L226 Difference]: Without dead ends: 72 [2022-01-09 23:20:05,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-01-09 23:20:05,208 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 165 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:20:05,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 68 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:20:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-09 23:20:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 41. [2022-01-09 23:20:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 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-01-09 23:20:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-01-09 23:20:05,212 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 32 [2022-01-09 23:20:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:20:05,212 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-01-09 23:20:05,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 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-01-09 23:20:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-01-09 23:20:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-09 23:20:05,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:20:05,213 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:20:05,229 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-01-09 23:20:05,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:05,427 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:20:05,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:20:05,428 INFO L85 PathProgramCache]: Analyzing trace with hash -143226682, now seen corresponding path program 2 times [2022-01-09 23:20:05,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:20:05,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563166397] [2022-01-09 23:20:05,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:20:05,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:20:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:20:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:20:05,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:20:05,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563166397] [2022-01-09 23:20:05,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563166397] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:20:05,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077690573] [2022-01-09 23:20:05,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:20:05,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:05,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:20:05,785 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-01-09 23:20:05,785 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-01-09 23:20:05,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:20:05,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:20:05,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-09 23:20:05,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:20:05,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-09 23:20:05,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:05,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-09 23:20:05,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:05,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-09 23:20:05,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:05,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:20:06,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:06,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:20:06,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:06,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:20:06,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:20:06,091 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:20:06,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2022-01-09 23:20:06,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:06,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-09 23:20:06,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:06,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-09 23:20:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-09 23:20:06,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:20:08,329 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-01-09 23:20:14,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)))) is different from false [2022-01-09 23:20:16,132 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-01-09 23:20:16,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)) (= (select (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-01-09 23:20:16,766 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (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_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) is different from false [2022-01-09 23:20:16,830 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (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| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) is different from false [2022-01-09 23:20:16,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)) (= 0 (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (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_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-01-09 23:20:16,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))))) is different from false [2022-01-09 23:20:17,025 INFO L353 Elim1Store]: treesize reduction 122, result has 23.3 percent of original size [2022-01-09 23:20:17,026 INFO L387 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 3 case distinctions, treesize of input 88 treesize of output 73 [2022-01-09 23:20:17,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2022-01-09 23:20:17,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:20:17,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:20:17,035 INFO L387 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 11 treesize of output 9 [2022-01-09 23:20:17,041 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:20:17,042 INFO L387 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 174 treesize of output 176 [2022-01-09 23:20:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 22 not checked. [2022-01-09 23:20:17,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077690573] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:20:17,139 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:20:17,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 17] total 42 [2022-01-09 23:20:17,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701805187] [2022-01-09 23:20:17,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:20:17,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-09 23:20:17,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:20:17,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-09 23:20:17,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=947, Unknown=19, NotChecked=568, Total=1722 [2022-01-09 23:20:17,140 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 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-01-09 23:20:19,159 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= |c_ULTIMATE.start_main_~i~0#1| 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_147|)) (forall ((v_ArrVal_434 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_147| 1) |v_ULTIMATE.start_main_~i~0#1_146|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_434) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))))) (or (= (select .cse0 0) 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-01-09 23:20:21,182 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_139| Int) (v_ArrVal_436 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (= (select (store (store (let ((.cse0 (select (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| (* |v_ULTIMATE.start_main_~i~0#1_146| 4)) v_ArrVal_436)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_139|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_146|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (or (= (select .cse1 0) 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-01-09 23:20:24,372 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_139| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_139| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_443) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_139| 1) |v_ULTIMATE.start_main_~i~0#1_138|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_139|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (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|)) 0)) is different from false [2022-01-09 23:20:26,425 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= (+ (div (* (- 1) |c_ULTIMATE.start_main_~a~0#1.offset|) 4) 3) c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-01-09 23:20:28,458 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (or (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (and (= (select .cse0 0) 0) (not (= (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-01-09 23:20:30,487 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_138| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_138|)) (forall ((v_ArrVal_444 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (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.offset| 0)) is different from false [2022-01-09 23:20:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:20:30,663 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2022-01-09 23:20:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-09 23:20:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 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) Word has length 35 [2022-01-09 23:20:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:20:30,664 INFO L225 Difference]: With dead ends: 82 [2022-01-09 23:20:30,664 INFO L226 Difference]: Without dead ends: 80 [2022-01-09 23:20:30,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 62 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=370, Invalid=2109, Unknown=27, NotChecked=1526, Total=4032 [2022-01-09 23:20:30,665 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:20:30,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 246 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 382 Invalid, 0 Unknown, 408 Unchecked, 0.2s Time] [2022-01-09 23:20:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-09 23:20:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 49. [2022-01-09 23:20:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 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-01-09 23:20:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-01-09 23:20:30,670 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 35 [2022-01-09 23:20:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:20:30,670 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-01-09 23:20:30,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 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-01-09 23:20:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-01-09 23:20:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-09 23:20:30,671 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:20:30,671 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:20:30,687 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-01-09 23:20:30,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-09 23:20:30,871 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:20:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:20:30,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1123059706, now seen corresponding path program 2 times [2022-01-09 23:20:30,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:20:30,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18435270] [2022-01-09 23:20:30,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:20:30,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:20:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:20:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-09 23:20:30,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:20:30,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18435270] [2022-01-09 23:20:30,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18435270] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:20:30,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63404544] [2022-01-09 23:20:30,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:20:30,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:30,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:20:30,933 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-01-09 23:20:30,944 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-01-09 23:20:31,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:20:31,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:20:31,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-09 23:20:31,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:20:31,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:20:31,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:31,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-01-09 23:20:31,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:31,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-01-09 23:20:31,148 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-09 23:20:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:20:31,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:20:31,177 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (not (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) is different from false [2022-01-09 23:20:31,186 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem11#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-01-09 23:20:31,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-01-09 23:20:31,201 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:20:31,202 INFO L387 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 18 treesize of output 19 [2022-01-09 23:20:31,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-09 23:20:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 12 not checked. [2022-01-09 23:20:31,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63404544] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:20:31,226 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:20:31,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 16 [2022-01-09 23:20:31,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547530165] [2022-01-09 23:20:31,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:20:31,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-09 23:20:31,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:20:31,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-09 23:20:31,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=119, Unknown=3, NotChecked=72, Total=240 [2022-01-09 23:20:31,227 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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-01-09 23:20:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:20:31,523 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-01-09 23:20:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-09 23:20:31,524 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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 35 [2022-01-09 23:20:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:20:31,524 INFO L225 Difference]: With dead ends: 116 [2022-01-09 23:20:31,524 INFO L226 Difference]: Without dead ends: 100 [2022-01-09 23:20:31,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=342, Unknown=3, NotChecked=126, Total=600 [2022-01-09 23:20:31,525 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 96 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 172 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:20:31,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 209 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 356 Invalid, 0 Unknown, 172 Unchecked, 0.2s Time] [2022-01-09 23:20:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-01-09 23:20:31,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 52. [2022-01-09 23:20:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 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-01-09 23:20:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-01-09 23:20:31,530 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 35 [2022-01-09 23:20:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:20:31,530 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-01-09 23:20:31,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 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-01-09 23:20:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-01-09 23:20:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-09 23:20:31,530 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:20:31,530 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:20:31,546 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-01-09 23:20:31,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-09 23:20:31,739 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:20:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:20:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash 651947656, now seen corresponding path program 6 times [2022-01-09 23:20:31,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:20:31,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215299579] [2022-01-09 23:20:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:20:31,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:20:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:20:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-09 23:20:32,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:20:32,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215299579] [2022-01-09 23:20:32,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215299579] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:20:32,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351609942] [2022-01-09 23:20:32,577 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-09 23:20:32,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:20:32,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:20:32,578 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-01-09 23:20:32,579 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-01-09 23:20:32,647 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-09 23:20:32,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:20:32,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-09 23:20:32,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:20:32,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:20:32,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:32,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-09 23:20:32,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:32,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:32,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-09 23:20:32,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:32,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:32,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:32,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:32,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-01-09 23:20:33,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-01-09 23:20:33,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,137 INFO L353 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-01-09 23:20:33,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 60 [2022-01-09 23:20:33,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,255 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-01-09 23:20:33,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 68 [2022-01-09 23:20:33,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 57 treesize of output 49 [2022-01-09 23:20:33,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:20:33,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:20:33,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:20:33,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-01-09 23:20:33,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-09 23:20:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:20:33,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:20:33,754 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 (Array Int Int))) (= c_~N~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-01-09 23:20:33,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_564 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse3 (* |ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse2)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from false [2022-01-09 23:20:33,970 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (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|))) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse1 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|) c_~N~0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_179| 1) c_~N~0)))) is different from false [2022-01-09 23:20:33,986 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse1 .cse2 .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (< (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|) c_~N~0) (not (< (+ |v_ULTIMATE.start_main_~i~0#1_179| 1) c_~N~0)))) is different from false [2022-01-09 23:20:39,899 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (let ((.cse0 (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|))) (or (<= |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_179|) (<= .cse0 |c_ULTIMATE.start_main_~i~0#1|) (<= .cse0 (select (select (store (let ((.cse7 (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|) 1))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse3 .cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse5)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (let ((.cse15 (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|))) (or (<= (select (select (store (let ((.cse14 (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|) 1))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse10 .cse11 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse12)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse15) (<= |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_179|) (<= .cse15 |c_ULTIMATE.start_main_~i~0#1|))))) is different from false [2022-01-09 23:20:39,938 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_179| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|) (select (select (store (let ((.cse6 (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| 4) 1))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse3 .cse4)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_179| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|) (<= (select (select (store (let ((.cse13 (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| 4) 1))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse13))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse11 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse10 .cse11)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|))))) is different from false [2022-01-09 23:20:40,362 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~i~0#1_179| |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_179|) (<= (select (select (store (let ((.cse6 (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse7 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse4 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse2 .cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse4)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~i~0#1_179| |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_179|) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|) (select (select (store (let ((.cse14 (let ((.cse15 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse15 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse10 .cse11 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse12)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) is different from false [2022-01-09 23:20:40,425 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~i~0#1_179| |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_179|) (<= (select (select (store (let ((.cse6 (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse7 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse3 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse2 .cse3 .cse4)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~i~0#1_179| |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_179|) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|) (select (select (store (let ((.cse14 (let ((.cse15 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1) (+ .cse15 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse11 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse10 .cse11 .cse12)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) is different from false [2022-01-09 23:20:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 17 not checked. [2022-01-09 23:20:40,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351609942] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:20:40,462 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:20:40,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 19] total 55 [2022-01-09 23:20:40,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151164942] [2022-01-09 23:20:40,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:20:40,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-01-09 23:20:40,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:20:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-01-09 23:20:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1930, Unknown=12, NotChecked=776, Total=2970 [2022-01-09 23:20:40,463 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 55 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:20:41,640 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (= (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#sum~0#1.offset| 0) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_179| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|) (select (select (store (let ((.cse8 (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| 4) 1))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8))) (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse6 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse5 .cse6)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~i~0#1_179| 1) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_179|) (<= (select (select (store (let ((.cse15 (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| 4) 1))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15))) (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse12 .cse13)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0))) is different from false [2022-01-09 23:20:42,716 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (= (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (let ((.cse2 (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|))) (or (<= |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_179|) (<= .cse2 |c_ULTIMATE.start_main_~i~0#1|) (<= .cse2 (select (select (store (let ((.cse9 (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|) 1))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9))) (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse5 .cse6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse7)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#sum~0#1.offset| 0) (= (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_179| Int) (v_ArrVal_564 (Array Int Int))) (let ((.cse17 (+ 2 |v_ULTIMATE.start_main_~i~0#1_179|))) (or (<= (select (select (store (let ((.cse16 (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|) 1))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse13 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (* |v_ULTIMATE.start_main_~i~0#1_179| 4))) (let ((.cse12 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse12 .cse13 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) .cse14)))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse17) (<= |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_179|) (<= .cse17 |c_ULTIMATE.start_main_~i~0#1|)))) (= (+ (- 2) |c_ULTIMATE.start_main_~i~0#1|) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false