/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 17:54:31,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 17:54:31,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 17:54:31,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 17:54:31,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 17:54:31,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 17:54:31,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 17:54:31,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 17:54:31,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 17:54:31,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 17:54:31,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 17:54:31,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 17:54:31,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 17:54:31,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 17:54:31,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 17:54:31,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 17:54:31,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 17:54:31,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 17:54:31,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 17:54:31,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 17:54:31,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 17:54:31,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 17:54:31,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 17:54:31,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 17:54:31,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 17:54:31,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 17:54:31,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 17:54:31,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 17:54:31,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 17:54:31,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 17:54:31,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 17:54:31,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 17:54:31,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 17:54:31,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 17:54:31,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 17:54:31,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 17:54:31,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 17:54:31,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 17:54:31,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 17:54:31,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 17:54:31,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 17:54:31,788 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 17:54:31,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 17:54:31,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 17:54:31,822 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 17:54:31,822 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 17:54:31,823 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 17:54:31,823 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 17:54:31,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 17:54:31,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 17:54:31,825 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 17:54:31,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 17:54:31,825 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 17:54:31,825 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 17:54:31,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 17:54:31,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 17:54:31,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 17:54:31,826 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 17:54:31,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 17:54:31,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 17:54:31,827 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 17:54:31,827 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 17:54:31,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 17:54:31,828 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 17:54:31,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 17:54:31,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 17:54:31,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 17:54:31,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 17:54:31,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:54:31,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 17:54:31,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 17:54:31,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 17:54:31,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 17:54:31,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 17:54:31,830 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 17:54:31,830 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 17:54:32,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 17:54:32,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 17:54:32,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 17:54:32,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 17:54:32,261 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 17:54:32,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i [2022-10-16 17:54:32,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e741f552/af4ea00870d94394bacdf6a66ec45ddb/FLAGdd83d7292 [2022-10-16 17:54:33,001 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 17:54:33,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i [2022-10-16 17:54:33,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e741f552/af4ea00870d94394bacdf6a66ec45ddb/FLAGdd83d7292 [2022-10-16 17:54:33,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e741f552/af4ea00870d94394bacdf6a66ec45ddb [2022-10-16 17:54:33,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 17:54:33,327 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 17:54:33,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 17:54:33,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 17:54:33,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 17:54:33,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:33,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c03428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33, skipping insertion in model container [2022-10-16 17:54:33,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:33,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 17:54:33,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 17:54:33,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:54:33,807 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 17:54:33,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:54:33,896 INFO L208 MainTranslator]: Completed translation [2022-10-16 17:54:33,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33 WrapperNode [2022-10-16 17:54:33,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 17:54:33,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 17:54:33,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 17:54:33,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 17:54:33,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:33,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:33,983 INFO L138 Inliner]: procedures = 111, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-10-16 17:54:33,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 17:54:33,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 17:54:33,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 17:54:33,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 17:54:33,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:33,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:34,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:34,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:34,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:34,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:34,032 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:34,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:34,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 17:54:34,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 17:54:34,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 17:54:34,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 17:54:34,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (1/1) ... [2022-10-16 17:54:34,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:54:34,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:54:34,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 17:54:34,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 17:54:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 17:54:34,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 17:54:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 17:54:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 17:54:34,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 17:54:34,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 17:54:34,327 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 17:54:34,331 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 17:54:34,590 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 17:54:34,598 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 17:54:34,598 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-16 17:54:34,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:54:34 BoogieIcfgContainer [2022-10-16 17:54:34,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 17:54:34,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 17:54:34,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 17:54:34,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 17:54:34,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:54:33" (1/3) ... [2022-10-16 17:54:34,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ea4a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:54:34, skipping insertion in model container [2022-10-16 17:54:34,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:54:33" (2/3) ... [2022-10-16 17:54:34,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ea4a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:54:34, skipping insertion in model container [2022-10-16 17:54:34,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:54:34" (3/3) ... [2022-10-16 17:54:34,612 INFO L112 eAbstractionObserver]: Analyzing ICFG aviad_true-alloca.i [2022-10-16 17:54:34,639 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 17:54:34,640 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-10-16 17:54:34,712 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 17:54:34,721 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6667a49a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 17:54:34,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-16 17:54:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 17:54:34,736 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:54:34,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 17:54:34,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:54:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:54:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash 889571465, now seen corresponding path program 1 times [2022-10-16 17:54:34,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:54:34,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500030429] [2022-10-16 17:54:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:34,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:54:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:35,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:54:35,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500030429] [2022-10-16 17:54:35,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500030429] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:54:35,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:54:35,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 17:54:35,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061380054] [2022-10-16 17:54:35,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:54:35,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:54:35,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:54:36,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:54:36,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:54:36,047 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 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) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:54:36,170 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-10-16 17:54:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 17:54:36,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 17:54:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:54:36,182 INFO L225 Difference]: With dead ends: 49 [2022-10-16 17:54:36,182 INFO L226 Difference]: Without dead ends: 33 [2022-10-16 17:54:36,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:54:36,190 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:54:36,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 38 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:54:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-16 17:54:36,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2022-10-16 17:54:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-10-16 17:54:36,232 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 6 [2022-10-16 17:54:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:54:36,233 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-10-16 17:54:36,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-10-16 17:54:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 17:54:36,234 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:54:36,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 17:54:36,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 17:54:36,235 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:54:36,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:54:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash 889571273, now seen corresponding path program 1 times [2022-10-16 17:54:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:54:36,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872676985] [2022-10-16 17:54:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:54:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:36,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:54:36,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872676985] [2022-10-16 17:54:36,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872676985] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:54:36,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:54:36,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 17:54:36,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562465441] [2022-10-16 17:54:36,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:54:36,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:54:36,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:54:36,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:54:36,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:54:36,766 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:36,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:54:36,868 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-10-16 17:54:36,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 17:54:36,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 17:54:36,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:54:36,870 INFO L225 Difference]: With dead ends: 33 [2022-10-16 17:54:36,871 INFO L226 Difference]: Without dead ends: 32 [2022-10-16 17:54:36,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:54:36,873 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:54:36,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 46 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:54:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-16 17:54:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-10-16 17:54:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-10-16 17:54:36,880 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 6 [2022-10-16 17:54:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:54:36,881 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-10-16 17:54:36,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-10-16 17:54:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 17:54:36,882 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:54:36,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:54:36,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 17:54:36,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:54:36,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:54:36,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1806911694, now seen corresponding path program 1 times [2022-10-16 17:54:36,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:54:36,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452327833] [2022-10-16 17:54:36,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:54:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:37,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:54:37,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452327833] [2022-10-16 17:54:37,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452327833] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:54:37,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:54:37,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:54:37,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912964954] [2022-10-16 17:54:37,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:54:37,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:54:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:54:37,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:54:37,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:54:37,044 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:54:37,101 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-10-16 17:54:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:54:37,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 17:54:37,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:54:37,103 INFO L225 Difference]: With dead ends: 23 [2022-10-16 17:54:37,103 INFO L226 Difference]: Without dead ends: 22 [2022-10-16 17:54:37,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:54:37,106 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:54:37,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:54:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-10-16 17:54:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-10-16 17:54:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-10-16 17:54:37,112 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 7 [2022-10-16 17:54:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:54:37,113 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-10-16 17:54:37,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-10-16 17:54:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 17:54:37,114 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:54:37,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:54:37,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 17:54:37,115 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:54:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:54:37,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1806905736, now seen corresponding path program 1 times [2022-10-16 17:54:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:54:37,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150572916] [2022-10-16 17:54:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:54:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:37,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:54:37,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150572916] [2022-10-16 17:54:37,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150572916] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:54:37,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:54:37,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:54:37,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570192917] [2022-10-16 17:54:37,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:54:37,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:54:37,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:54:37,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:54:37,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:54:37,360 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:54:37,438 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-10-16 17:54:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:54:37,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 17:54:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:54:37,440 INFO L225 Difference]: With dead ends: 22 [2022-10-16 17:54:37,440 INFO L226 Difference]: Without dead ends: 21 [2022-10-16 17:54:37,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-16 17:54:37,443 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:54:37,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 36 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:54:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-10-16 17:54:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-10-16 17:54:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-10-16 17:54:37,449 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2022-10-16 17:54:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:54:37,450 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-10-16 17:54:37,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-10-16 17:54:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 17:54:37,451 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:54:37,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:54:37,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 17:54:37,452 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:54:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:54:37,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1275352176, now seen corresponding path program 1 times [2022-10-16 17:54:37,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:54:37,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25041272] [2022-10-16 17:54:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:37,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:54:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:37,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:54:37,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25041272] [2022-10-16 17:54:37,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25041272] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:54:37,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:54:37,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:54:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181829912] [2022-10-16 17:54:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:54:37,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:54:37,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:54:37,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:54:37,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:54:37,790 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:54:37,952 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-10-16 17:54:37,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:54:37,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-16 17:54:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:54:37,954 INFO L225 Difference]: With dead ends: 28 [2022-10-16 17:54:37,954 INFO L226 Difference]: Without dead ends: 26 [2022-10-16 17:54:37,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-16 17:54:37,956 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:54:37,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 35 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:54:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-16 17:54:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-16 17:54:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-10-16 17:54:37,963 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 9 [2022-10-16 17:54:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:54:37,963 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-10-16 17:54:37,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-10-16 17:54:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 17:54:37,965 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:54:37,965 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:54:37,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 17:54:37,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:54:37,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:54:37,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1340341996, now seen corresponding path program 1 times [2022-10-16 17:54:37,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:54:37,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724856332] [2022-10-16 17:54:37,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:37,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:54:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:38,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:54:38,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724856332] [2022-10-16 17:54:38,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724856332] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:54:38,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510501187] [2022-10-16 17:54:38,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:38,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:54:38,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:54:38,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:54:38,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 17:54:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:38,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-16 17:54:38,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:54:38,837 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-10-16 17:54:38,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-10-16 17:54:38,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:54:38,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:54:38,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:54:39,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:54:39,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:54:39,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:54:39,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:54:39,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 73 [2022-10-16 17:54:39,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:39,170 INFO L356 Elim1Store]: treesize reduction 48, result has 26.2 percent of original size [2022-10-16 17:54:39,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 116 treesize of output 123 [2022-10-16 17:54:39,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:39,442 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-10-16 17:54:39,443 INFO L390 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 3 case distinctions, treesize of input 66 treesize of output 25 [2022-10-16 17:54:39,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 17:54:40,132 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-10-16 17:54:40,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 348 treesize of output 349 [2022-10-16 17:54:40,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-10-16 17:54:40,259 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-10-16 17:54:40,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-16 17:54:40,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:54:40,463 INFO L390 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 34 treesize of output 29 [2022-10-16 17:54:40,567 INFO L390 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 25 treesize of output 25 [2022-10-16 17:54:40,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:40,680 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-16 17:54:40,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2022-10-16 17:54:40,854 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:54:40,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2022-10-16 17:54:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:40,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:54:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:41,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510501187] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:54:41,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:54:41,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-10-16 17:54:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371965258] [2022-10-16 17:54:41,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:54:41,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-16 17:54:41,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:54:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-16 17:54:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=556, Unknown=20, NotChecked=0, Total=702 [2022-10-16 17:54:41,685 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 27 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-10-16 17:54:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:54:42,276 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-10-16 17:54:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 17:54:42,277 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 27 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 14 [2022-10-16 17:54:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:54:42,278 INFO L225 Difference]: With dead ends: 40 [2022-10-16 17:54:42,278 INFO L226 Difference]: Without dead ends: 39 [2022-10-16 17:54:42,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=236, Invalid=866, Unknown=20, NotChecked=0, Total=1122 [2022-10-16 17:54:42,280 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:54:42,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 98 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 52 Unchecked, 0.0s Time] [2022-10-16 17:54:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-16 17:54:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-10-16 17:54:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 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-10-16 17:54:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-10-16 17:54:42,288 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 14 [2022-10-16 17:54:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:54:42,288 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-10-16 17:54:42,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 27 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-10-16 17:54:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-10-16 17:54:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 17:54:42,290 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:54:42,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:54:42,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 17:54:42,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-16 17:54:42,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:54:42,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:54:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1340342188, now seen corresponding path program 1 times [2022-10-16 17:54:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:54:42,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272426877] [2022-10-16 17:54:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:54:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:54:42,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272426877] [2022-10-16 17:54:42,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272426877] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:54:42,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196080137] [2022-10-16 17:54:42,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:42,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:54:42,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:54:42,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:54:42,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 17:54:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:42,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 17:54:42,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:54:43,115 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-10-16 17:54:43,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-10-16 17:54:43,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:54:43,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:54:43,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:54:43,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:54:43,579 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-10-16 17:54:43,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 494 treesize of output 457 [2022-10-16 17:54:43,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:43,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:43,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:43,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:44,815 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-10-16 17:54:44,816 INFO L390 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 3 case distinctions, treesize of input 570 treesize of output 575 [2022-10-16 17:54:44,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-10-16 17:54:44,943 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-10-16 17:54:45,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-10-16 17:54:45,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-16 17:54:45,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:54:45,187 INFO L390 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 34 treesize of output 29 [2022-10-16 17:54:45,277 INFO L390 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 25 treesize of output 25 [2022-10-16 17:54:45,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:45,339 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-16 17:54:45,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-10-16 17:54:45,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:54:45,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-10-16 17:54:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:45,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:54:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:45,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196080137] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:54:45,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:54:45,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2022-10-16 17:54:45,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853250103] [2022-10-16 17:54:45,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:54:45,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-16 17:54:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:54:45,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-16 17:54:45,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=452, Unknown=20, NotChecked=0, Total=552 [2022-10-16 17:54:45,973 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 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-10-16 17:54:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:54:46,700 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-10-16 17:54:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 17:54:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 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 14 [2022-10-16 17:54:46,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:54:46,702 INFO L225 Difference]: With dead ends: 52 [2022-10-16 17:54:46,702 INFO L226 Difference]: Without dead ends: 51 [2022-10-16 17:54:46,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=214, Invalid=888, Unknown=20, NotChecked=0, Total=1122 [2022-10-16 17:54:46,705 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:54:46,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 148 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2022-10-16 17:54:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-16 17:54:46,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2022-10-16 17:54:46,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-10-16 17:54:46,713 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 14 [2022-10-16 17:54:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:54:46,713 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-10-16 17:54:46,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 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-10-16 17:54:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-10-16 17:54:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 17:54:46,714 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:54:46,715 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:54:46,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 17:54:46,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-16 17:54:46,931 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:54:46,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:54:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash 226603802, now seen corresponding path program 1 times [2022-10-16 17:54:46,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:54:46,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612298686] [2022-10-16 17:54:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:54:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:47,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:54:47,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612298686] [2022-10-16 17:54:47,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612298686] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:54:47,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567368743] [2022-10-16 17:54:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:47,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:54:47,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:54:47,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:54:47,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 17:54:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:47,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 39 conjunts are in the unsatisfiable core [2022-10-16 17:54:47,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:54:47,910 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-10-16 17:54:47,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-10-16 17:54:47,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:54:47,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:54:47,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:54:48,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:54:48,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:54:48,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:54:48,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:54:48,236 INFO L390 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 85 treesize of output 48 [2022-10-16 17:54:48,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:48,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:48,307 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-10-16 17:54:48,307 INFO L390 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 3 case distinctions, treesize of input 66 treesize of output 25 [2022-10-16 17:54:48,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:49,542 INFO L356 Elim1Store]: treesize reduction 42, result has 45.5 percent of original size [2022-10-16 17:54:49,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 840 treesize of output 809 [2022-10-16 17:54:49,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:54:49,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-10-16 17:54:49,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-16 17:54:49,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-10-16 17:54:49,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:54:49,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 13 [2022-10-16 17:54:49,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-10-16 17:54:49,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 60 [2022-10-16 17:54:50,527 INFO L356 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2022-10-16 17:54:50,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 148 treesize of output 114 [2022-10-16 17:54:50,812 INFO L356 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2022-10-16 17:54:50,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 64 [2022-10-16 17:54:50,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-10-16 17:54:51,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-10-16 17:54:51,134 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 17:54:51,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2022-10-16 17:54:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:51,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:54:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:52,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567368743] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:54:52,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:54:52,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 29 [2022-10-16 17:54:52,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713904609] [2022-10-16 17:54:52,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:54:52,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 17:54:52,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:54:52,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 17:54:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=708, Unknown=20, NotChecked=0, Total=870 [2022-10-16 17:54:52,894 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:54:54,236 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-10-16 17:54:54,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 17:54:54,243 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 17:54:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:54:54,244 INFO L225 Difference]: With dead ends: 69 [2022-10-16 17:54:54,244 INFO L226 Difference]: Without dead ends: 67 [2022-10-16 17:54:54,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=297, Invalid=1310, Unknown=33, NotChecked=0, Total=1640 [2022-10-16 17:54:54,246 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:54:54,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 198 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 120 Invalid, 0 Unknown, 164 Unchecked, 0.1s Time] [2022-10-16 17:54:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-16 17:54:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2022-10-16 17:54:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 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-10-16 17:54:54,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-10-16 17:54:54,255 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 14 [2022-10-16 17:54:54,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:54:54,256 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-10-16 17:54:54,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:54:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-10-16 17:54:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 17:54:54,257 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:54:54,257 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-10-16 17:54:54,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 17:54:54,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:54:54,473 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:54:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:54:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash 182602757, now seen corresponding path program 1 times [2022-10-16 17:54:54,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:54:54,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257938135] [2022-10-16 17:54:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:54,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:54:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:55,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:54:55,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257938135] [2022-10-16 17:54:55,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257938135] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:54:55,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893261382] [2022-10-16 17:54:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:54:55,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:54:55,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:54:55,023 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:54:55,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 17:54:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:54:55,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 41 conjunts are in the unsatisfiable core [2022-10-16 17:54:55,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:54:55,233 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-10-16 17:54:55,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-10-16 17:54:55,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:54:55,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:54:55,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:54:55,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:54:55,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:54:55,369 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-10-16 17:54:55,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 98 [2022-10-16 17:54:55,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:55,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:55,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:54:55,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:54:55,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 92 treesize of output 83 [2022-10-16 17:54:55,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:55,514 INFO L356 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-10-16 17:54:55,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 102 [2022-10-16 17:54:55,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:55,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:54:56,075 INFO L356 Elim1Store]: treesize reduction 34, result has 50.7 percent of original size [2022-10-16 17:54:56,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 332 treesize of output 337 [2022-10-16 17:54:56,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:54:56,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:54:56,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 83 [2022-10-16 17:54:56,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-10-16 17:54:56,614 INFO L356 Elim1Store]: treesize reduction 40, result has 43.7 percent of original size [2022-10-16 17:54:56,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 81 [2022-10-16 17:54:56,948 INFO L356 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2022-10-16 17:54:56,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 70 [2022-10-16 17:54:57,273 INFO L356 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-10-16 17:54:57,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 61 [2022-10-16 17:54:57,504 INFO L356 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2022-10-16 17:54:57,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 46 [2022-10-16 17:54:57,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:54:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:54:57,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:03,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893261382] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:55:03,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:55:03,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2022-10-16 17:55:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648882822] [2022-10-16 17:55:03,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:55:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 17:55:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 17:55:03,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=779, Unknown=3, NotChecked=0, Total=1056 [2022-10-16 17:55:03,640 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:55:04,700 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-10-16 17:55:04,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-16 17:55:04,700 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 17:55:04,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:55:04,703 INFO L225 Difference]: With dead ends: 65 [2022-10-16 17:55:04,703 INFO L226 Difference]: Without dead ends: 64 [2022-10-16 17:55:04,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=495, Invalid=1308, Unknown=3, NotChecked=0, Total=1806 [2022-10-16 17:55:04,705 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 63 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:55:04,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 66 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2022-10-16 17:55:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-16 17:55:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-10-16 17:55:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.293103448275862) internal successors, (75), 61 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-10-16 17:55:04,715 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 17 [2022-10-16 17:55:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:55:04,715 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-10-16 17:55:04,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-10-16 17:55:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 17:55:04,717 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:55:04,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:55:04,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 17:55:04,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:04,930 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:55:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:55:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash 176877119, now seen corresponding path program 1 times [2022-10-16 17:55:04,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:55:04,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304957767] [2022-10-16 17:55:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:04,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:55:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:05,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:55:05,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304957767] [2022-10-16 17:55:05,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304957767] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:05,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883545642] [2022-10-16 17:55:05,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:05,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:05,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:55:05,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:55:05,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 17:55:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:05,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 39 conjunts are in the unsatisfiable core [2022-10-16 17:55:05,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:55:05,562 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 17:55:05,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2022-10-16 17:55:05,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:05,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:05,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-10-16 17:55:05,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:55:05,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-10-16 17:55:05,755 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 17:55:05,756 INFO L390 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 2 case distinctions, treesize of input 21 treesize of output 25 [2022-10-16 17:55:05,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-16 17:55:05,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:05,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:05,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:55:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:06,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:06,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:55:06,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:55:06,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_510 Int) (v_ArrVal_512 (Array Int Int))) (or (not (<= v_ArrVal_510 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_510)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))) is different from false [2022-10-16 17:55:06,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_510 Int) (v_ArrVal_512 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_510) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_510)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647)))) is different from false [2022-10-16 17:55:06,116 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_510 Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_509 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_509))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (select (select (store (store (store .cse0 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_510)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_510))))) is different from false [2022-10-16 17:55:06,153 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_510 Int) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_509))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_510) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_510)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))) (not (< 1 |c_ULTIMATE.start_f_#t~mem5#1|))) is different from false [2022-10-16 17:55:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-10-16 17:55:06,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883545642] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:55:06,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:55:06,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-10-16 17:55:06,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032291740] [2022-10-16 17:55:06,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:55:06,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-16 17:55:06,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:06,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-16 17:55:06,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=308, Unknown=6, NotChecked=258, Total=702 [2022-10-16 17:55:06,236 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:55:06,871 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-10-16 17:55:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 17:55:06,872 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 17:55:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:55:06,873 INFO L225 Difference]: With dead ends: 93 [2022-10-16 17:55:06,873 INFO L226 Difference]: Without dead ends: 92 [2022-10-16 17:55:06,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=256, Invalid=573, Unknown=7, NotChecked=354, Total=1190 [2022-10-16 17:55:06,874 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:55:06,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 66 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 73 Invalid, 0 Unknown, 119 Unchecked, 0.1s Time] [2022-10-16 17:55:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-10-16 17:55:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-10-16 17:55:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 91 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:06,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2022-10-16 17:55:06,886 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 17 [2022-10-16 17:55:06,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:55:06,886 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2022-10-16 17:55:06,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:06,887 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-10-16 17:55:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 17:55:06,887 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:55:06,888 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-10-16 17:55:06,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 17:55:07,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-16 17:55:07,104 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:55:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:55:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1365718232, now seen corresponding path program 1 times [2022-10-16 17:55:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:55:07,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303191913] [2022-10-16 17:55:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:55:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:07,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:55:07,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303191913] [2022-10-16 17:55:07,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303191913] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:07,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993032491] [2022-10-16 17:55:07,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:07,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:07,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:55:07,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:55:07,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 17:55:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:07,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 41 conjunts are in the unsatisfiable core [2022-10-16 17:55:07,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:55:07,739 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-16 17:55:07,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-10-16 17:55:07,975 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:55:07,976 INFO L390 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 2 case distinctions, treesize of input 65 treesize of output 56 [2022-10-16 17:55:08,155 INFO L356 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-10-16 17:55:08,155 INFO L390 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 3 case distinctions, treesize of input 36 treesize of output 54 [2022-10-16 17:55:08,489 INFO L356 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2022-10-16 17:55:08,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 68 [2022-10-16 17:55:09,246 INFO L356 Elim1Store]: treesize reduction 55, result has 51.3 percent of original size [2022-10-16 17:55:09,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 106 treesize of output 115 [2022-10-16 17:55:10,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:55:10,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 68 [2022-10-16 17:55:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:10,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:10,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993032491] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:10,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-16 17:55:10,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 12] total 26 [2022-10-16 17:55:10,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747076259] [2022-10-16 17:55:10,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:55:10,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:55:10,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:10,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:55:10,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-10-16 17:55:10,776 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:55:10,816 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-10-16 17:55:10,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 17:55:10,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-16 17:55:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:55:10,819 INFO L225 Difference]: With dead ends: 99 [2022-10-16 17:55:10,819 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 17:55:10,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-10-16 17:55:10,822 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:55:10,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 52 Unchecked, 0.0s Time] [2022-10-16 17:55:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 17:55:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-10-16 17:55:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 97 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2022-10-16 17:55:10,848 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 18 [2022-10-16 17:55:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:55:10,852 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2022-10-16 17:55:10,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2022-10-16 17:55:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 17:55:10,853 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:55:10,854 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:55:10,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 17:55:11,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:11,054 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:55:11,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:55:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1188223454, now seen corresponding path program 1 times [2022-10-16 17:55:11,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:55:11,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010682278] [2022-10-16 17:55:11,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:11,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:55:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:11,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:55:11,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010682278] [2022-10-16 17:55:11,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010682278] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:11,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066677812] [2022-10-16 17:55:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:11,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:11,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:55:11,515 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:55:11,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 17:55:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:11,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 17:55:11,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:55:11,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-10-16 17:55:11,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 17:55:11,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 17:55:11,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 17:55:11,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-10-16 17:55:11,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:11,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:11,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_663) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|)))) is different from false [2022-10-16 17:55:11,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_663 (Array Int Int)) (v_ArrVal_662 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_662) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_663) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483650))) is different from false [2022-10-16 17:55:11,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:55:11,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-10-16 17:55:11,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 127 [2022-10-16 17:55:11,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-10-16 17:55:11,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-10-16 17:55:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-10-16 17:55:11,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066677812] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:55:11,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:55:11,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-10-16 17:55:11,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092458448] [2022-10-16 17:55:11,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:55:11,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 17:55:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:11,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 17:55:11,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2022-10-16 17:55:11,869 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:55:12,252 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2022-10-16 17:55:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 17:55:12,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-16 17:55:12,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:55:12,254 INFO L225 Difference]: With dead ends: 121 [2022-10-16 17:55:12,255 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 17:55:12,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=285, Unknown=3, NotChecked=74, Total=462 [2022-10-16 17:55:12,256 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 99 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:55:12,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 54 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 105 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2022-10-16 17:55:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 17:55:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 91. [2022-10-16 17:55:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 90 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2022-10-16 17:55:12,267 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 18 [2022-10-16 17:55:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:55:12,267 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2022-10-16 17:55:12,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2022-10-16 17:55:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 17:55:12,268 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:55:12,269 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1] [2022-10-16 17:55:12,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 17:55:12,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:12,483 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:55:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:55:12,484 INFO L85 PathProgramCache]: Analyzing trace with hash 782401183, now seen corresponding path program 2 times [2022-10-16 17:55:12,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:55:12,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151519590] [2022-10-16 17:55:12,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:12,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:55:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:13,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:55:13,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151519590] [2022-10-16 17:55:13,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151519590] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:13,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268444839] [2022-10-16 17:55:13,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 17:55:13,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:13,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:55:13,074 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:55:13,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 17:55:13,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 17:55:13,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:55:13,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 17:55:13,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:55:13,185 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 17:55:13,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-10-16 17:55:13,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 17:55:13,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:13,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:13,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:55:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 17:55:13,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:13,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_744) |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 2147483649)) is different from false [2022-10-16 17:55:13,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| v_ArrVal_743) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_744) |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 2147483649)) is different from false [2022-10-16 17:55:13,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:55:13,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-10-16 17:55:13,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2022-10-16 17:55:13,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-10-16 17:55:13,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-10-16 17:55:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2022-10-16 17:55:13,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268444839] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:55:13,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:55:13,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2022-10-16 17:55:13,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577607305] [2022-10-16 17:55:13,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:55:13,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 17:55:13,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:13,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 17:55:13,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=320, Unknown=2, NotChecked=78, Total=506 [2022-10-16 17:55:13,652 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:55:13,989 INFO L93 Difference]: Finished difference Result 125 states and 144 transitions. [2022-10-16 17:55:13,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:55:13,990 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-16 17:55:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:55:13,991 INFO L225 Difference]: With dead ends: 125 [2022-10-16 17:55:13,991 INFO L226 Difference]: Without dead ends: 124 [2022-10-16 17:55:13,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=460, Unknown=4, NotChecked=98, Total=756 [2022-10-16 17:55:13,993 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:55:13,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 81 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 101 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-10-16 17:55:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-10-16 17:55:14,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2022-10-16 17:55:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 100 states have (on average 1.18) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-10-16 17:55:14,004 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 22 [2022-10-16 17:55:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:55:14,005 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-10-16 17:55:14,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.590909090909091) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-10-16 17:55:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 17:55:14,006 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:55:14,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:55:14,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 17:55:14,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-16 17:55:14,222 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:55:14,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:55:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1945620315, now seen corresponding path program 1 times [2022-10-16 17:55:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:55:14,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549005652] [2022-10-16 17:55:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:14,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:55:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 17:55:14,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:55:14,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549005652] [2022-10-16 17:55:14,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549005652] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:14,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724443926] [2022-10-16 17:55:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:14,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:14,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:55:14,768 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:55:14,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 17:55:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:14,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjunts are in the unsatisfiable core [2022-10-16 17:55:14,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:55:15,001 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-10-16 17:55:15,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-10-16 17:55:15,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:55:15,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:55:15,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:55:15,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:15,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:15,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:15,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:15,375 INFO L390 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 78 treesize of output 23 [2022-10-16 17:55:15,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:15,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:15,560 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-10-16 17:55:15,560 INFO L390 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 3 case distinctions, treesize of input 262 treesize of output 221 [2022-10-16 17:55:15,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-16 17:55:16,329 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-10-16 17:55:16,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1156 treesize of output 1128 [2022-10-16 17:55:16,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:55:16,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-10-16 17:55:16,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:55:16,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:55:16,860 INFO L356 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2022-10-16 17:55:16,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 17:55:17,262 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:55:17,263 INFO L390 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 2 case distinctions, treesize of input 131 treesize of output 94 [2022-10-16 17:55:17,468 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-10-16 17:55:17,468 INFO L390 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 2 case distinctions, treesize of input 38 treesize of output 45 [2022-10-16 17:55:17,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:55:17,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-10-16 17:55:17,731 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 17:55:17,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2022-10-16 17:55:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:17,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:19,849 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-10-16 17:55:19,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 112 [2022-10-16 17:55:19,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:55:19,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 337 treesize of output 321 [2022-10-16 17:55:19,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 287 [2022-10-16 17:55:20,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:55:20,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 168 [2022-10-16 17:55:20,113 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:55:20,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 196 [2022-10-16 17:55:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:20,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724443926] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:55:20,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:55:20,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2022-10-16 17:55:20,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165635081] [2022-10-16 17:55:20,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:55:20,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 17:55:20,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:20,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 17:55:20,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=831, Unknown=40, NotChecked=0, Total=1056 [2022-10-16 17:55:20,520 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 33 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-10-16 17:55:20,573 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (let ((.cse20 (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (.cse23 (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse19 (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (.cse21 (<= .cse23 2147483647)) (.cse22 (not .cse20))) (and (let ((.cse0 (= |c_ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) 0))) (or (and .cse0 (or (exists ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse6 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_56))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (and (= .cse1 .cse2) (exists ((v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse4 (store (store (store (store (store (store .cse6 |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_47)) (.cse3 (select v_DerPreprocessor_47 0))) (and (<= .cse3 0) (= v_DerPreprocessor_46 (select .cse4 |c_ULTIMATE.start_f_~tmp~0#1.base|)) (= (select v_DerPreprocessor_56 0) .cse3) (= (select .cse4 |c_ULTIMATE.start_f_~a_ref~0#1.base|) .cse2) (= .cse5 .cse3)))) (= v_DerPreprocessor_55 (select .cse6 |c_ULTIMATE.start_f_~tmp~0#1.base|)))))) (exists ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse12 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_56))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.base|)) (.cse9 (select .cse12 |c_ULTIMATE.start_f_~tmp~0#1.base|))) (and (= .cse1 .cse7) (exists ((v_prenex_93 (Array Int Int)) (v_prenex_92 (Array Int Int)) (v_prenex_91 (Array Int Int))) (let ((.cse11 (store (store (store (store (store (store .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.base| v_prenex_91) |c_ULTIMATE.start_f_~tmp~0#1.base| v_prenex_92) |c_ULTIMATE.start_f_~count~0#1.base| v_prenex_93) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_prenex_91) |c_ULTIMATE.start_f_~tmp~0#1.base| v_prenex_92) |c_ULTIMATE.start_f_~count~0#1.base| v_prenex_93))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_f_~tmp~0#1.base|))) (and (= .cse8 v_prenex_92) (<= (select v_prenex_93 0) 0) (= .cse8 .cse9) (= .cse8 .cse10) (= (select .cse11 |c_ULTIMATE.start_f_~a_ref~0#1.base|) .cse7))))) (= v_DerPreprocessor_55 .cse9))))))) (and (exists ((v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse15 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_47))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_f_~a_ref~0#1.base|)) (.cse13 (select v_DerPreprocessor_47 0))) (and (<= .cse13 0) (= .cse14 v_DerPreprocessor_45) (= (select .cse15 |c_ULTIMATE.start_f_~tmp~0#1.base|) .cse10) (= .cse14 .cse1) (= .cse5 .cse13))))) (not .cse0)) (and (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (let ((.cse17 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_53))) (let ((.cse18 (store (store (store (store (store (store .cse17 |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_50)) (.cse16 (select v_DerPreprocessor_50 0))) (and (<= .cse16 0) (= v_DerPreprocessor_52 (select .cse17 |c_ULTIMATE.start_f_~tmp~0#1.base|)) (= v_DerPreprocessor_49 (select .cse18 |c_ULTIMATE.start_f_~tmp~0#1.base|)) (= .cse5 .cse16) (= (select .cse18 |c_ULTIMATE.start_f_~a_ref~0#1.base|) v_DerPreprocessor_48) (= v_DerPreprocessor_51 (select .cse17 |c_ULTIMATE.start_f_~a_ref~0#1.base|)) (= (select v_DerPreprocessor_53 0) .cse16))))) .cse19))) (not .cse19) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (or (= (select .cse10 |c_ULTIMATE.start_f_~tmp~0#1.offset|) 0) .cse20) (= |c_ULTIMATE.start_f_~tmp~0#1.offset| 0) (or (and .cse21 .cse22) (<= .cse23 0)) .cse21 .cse22)))) is different from true [2022-10-16 17:55:20,589 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (let ((.cse19 (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse20 (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|)) (.cse21 (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)))) (and (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) 0))) (or (and .cse0 (or (exists ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse6 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_56))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (and (= .cse1 .cse2) (exists ((v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse4 (store (store (store (store (store (store .cse6 |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_47)) (.cse3 (select v_DerPreprocessor_47 0))) (and (<= .cse3 0) (= v_DerPreprocessor_46 (select .cse4 |c_ULTIMATE.start_f_~tmp~0#1.base|)) (= (select v_DerPreprocessor_56 0) .cse3) (= (select .cse4 |c_ULTIMATE.start_f_~a_ref~0#1.base|) .cse2) (= .cse5 .cse3)))) (= v_DerPreprocessor_55 (select .cse6 |c_ULTIMATE.start_f_~tmp~0#1.base|)))))) (exists ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse12 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_56))) (let ((.cse7 (select .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.base|)) (.cse9 (select .cse12 |c_ULTIMATE.start_f_~tmp~0#1.base|))) (and (= .cse1 .cse7) (exists ((v_prenex_93 (Array Int Int)) (v_prenex_92 (Array Int Int)) (v_prenex_91 (Array Int Int))) (let ((.cse11 (store (store (store (store (store (store .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.base| v_prenex_91) |c_ULTIMATE.start_f_~tmp~0#1.base| v_prenex_92) |c_ULTIMATE.start_f_~count~0#1.base| v_prenex_93) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_prenex_91) |c_ULTIMATE.start_f_~tmp~0#1.base| v_prenex_92) |c_ULTIMATE.start_f_~count~0#1.base| v_prenex_93))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_f_~tmp~0#1.base|))) (and (= .cse8 v_prenex_92) (<= (select v_prenex_93 0) 0) (= .cse8 .cse9) (= .cse8 .cse10) (= (select .cse11 |c_ULTIMATE.start_f_~a_ref~0#1.base|) .cse7))))) (= v_DerPreprocessor_55 .cse9))))))) (and (exists ((v_DerPreprocessor_45 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse15 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_47))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_f_~a_ref~0#1.base|)) (.cse13 (select v_DerPreprocessor_47 0))) (and (<= .cse13 0) (= .cse14 v_DerPreprocessor_45) (= (select .cse15 |c_ULTIMATE.start_f_~tmp~0#1.base|) .cse10) (= .cse14 .cse1) (= .cse5 .cse13))))) (not .cse0)) (and (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int))) (let ((.cse17 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_53))) (let ((.cse18 (store (store (store (store (store (store .cse17 |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_f_~tmp~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_f_~count~0#1.base| v_DerPreprocessor_50)) (.cse16 (select v_DerPreprocessor_50 0))) (and (<= .cse16 0) (= v_DerPreprocessor_52 (select .cse17 |c_ULTIMATE.start_f_~tmp~0#1.base|)) (= v_DerPreprocessor_49 (select .cse18 |c_ULTIMATE.start_f_~tmp~0#1.base|)) (= .cse5 .cse16) (= (select .cse18 |c_ULTIMATE.start_f_~a_ref~0#1.base|) v_DerPreprocessor_48) (= v_DerPreprocessor_51 (select .cse17 |c_ULTIMATE.start_f_~a_ref~0#1.base|)) (= (select v_DerPreprocessor_53 0) .cse16))))) .cse19))) (<= |c_ULTIMATE.start_f_#t~mem5#1| .cse20) (not .cse19) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (= |c_ULTIMATE.start_f_~tmp~0#1.offset| 0) (or (and (<= .cse20 2147483647) .cse21) (<= .cse20 0)) .cse21))) is different from true [2022-10-16 17:55:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:55:21,558 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2022-10-16 17:55:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 17:55:21,559 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 33 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) Word has length 22 [2022-10-16 17:55:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:55:21,560 INFO L225 Difference]: With dead ends: 111 [2022-10-16 17:55:21,560 INFO L226 Difference]: Without dead ends: 109 [2022-10-16 17:55:21,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=416, Invalid=1521, Unknown=51, NotChecked=174, Total=2162 [2022-10-16 17:55:21,563 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 17:55:21,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 77 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 137 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2022-10-16 17:55:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-10-16 17:55:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2022-10-16 17:55:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 80 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-10-16 17:55:21,576 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 22 [2022-10-16 17:55:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:55:21,577 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-10-16 17:55:21,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 33 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-10-16 17:55:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-10-16 17:55:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-16 17:55:21,583 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:55:21,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:55:21,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 17:55:21,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 17:55:21,798 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:55:21,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:55:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1708181989, now seen corresponding path program 1 times [2022-10-16 17:55:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:55:21,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892880000] [2022-10-16 17:55:21,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:55:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:22,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:55:22,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892880000] [2022-10-16 17:55:22,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892880000] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:22,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240797017] [2022-10-16 17:55:22,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:22,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:22,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:55:22,812 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:55:22,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 17:55:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:22,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 17:55:22,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:55:23,107 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-10-16 17:55:23,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-10-16 17:55:23,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:55:23,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:55:23,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:55:23,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:23,748 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-10-16 17:55:23,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 426 treesize of output 383 [2022-10-16 17:55:23,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-10-16 17:55:23,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-10-16 17:55:23,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:24,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:24,780 INFO L356 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-10-16 17:55:24,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 600 treesize of output 578 [2022-10-16 17:55:24,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-16 17:55:24,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:55:24,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:55:25,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 17:55:25,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:25,218 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-16 17:55:25,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-10-16 17:55:25,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:55:25,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2022-10-16 17:55:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 8 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 17:55:25,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:25,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:55:25,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2022-10-16 17:55:25,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:55:25,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 228 [2022-10-16 17:55:25,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 222 [2022-10-16 17:55:25,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2022-10-16 17:55:25,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 166 [2022-10-16 17:55:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 3 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 17:55:26,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240797017] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:55:26,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:55:26,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2022-10-16 17:55:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92660946] [2022-10-16 17:55:26,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:55:26,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 17:55:26,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:26,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 17:55:26,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=608, Unknown=12, NotChecked=0, Total=756 [2022-10-16 17:55:26,468 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:55:27,328 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2022-10-16 17:55:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:55:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-16 17:55:27,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:55:27,333 INFO L225 Difference]: With dead ends: 123 [2022-10-16 17:55:27,333 INFO L226 Difference]: Without dead ends: 122 [2022-10-16 17:55:27,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=307, Invalid=1239, Unknown=14, NotChecked=0, Total=1560 [2022-10-16 17:55:27,335 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:55:27,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 78 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 98 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-10-16 17:55:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-10-16 17:55:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 56. [2022-10-16 17:55:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-10-16 17:55:27,344 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 22 [2022-10-16 17:55:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:55:27,344 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-10-16 17:55:27,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 28 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-10-16 17:55:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 17:55:27,345 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:55:27,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-16 17:55:27,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 17:55:27,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 17:55:27,562 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:55:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:55:27,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1391089964, now seen corresponding path program 2 times [2022-10-16 17:55:27,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:55:27,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654477411] [2022-10-16 17:55:27,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:27,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:55:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:28,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:55:28,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654477411] [2022-10-16 17:55:28,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654477411] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:28,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355143610] [2022-10-16 17:55:28,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 17:55:28,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:28,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:55:28,208 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:55:28,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 17:55:28,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 17:55:28,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:55:28,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 48 conjunts are in the unsatisfiable core [2022-10-16 17:55:28,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:55:28,472 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-10-16 17:55:28,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-10-16 17:55:28,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:55:28,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:55:28,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:55:28,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:28,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:28,862 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 70 [2022-10-16 17:55:28,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-10-16 17:55:28,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 17:55:28,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:28,900 INFO L356 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-10-16 17:55:28,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 164 [2022-10-16 17:55:28,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-10-16 17:55:28,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:28,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:29,022 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 17:55:29,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-10-16 17:55:29,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:29,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:29,454 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 17:55:29,455 INFO L390 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 1 case distinctions, treesize of input 164 treesize of output 147 [2022-10-16 17:55:29,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:29,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:29,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-10-16 17:55:29,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:29,583 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:55:29,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-16 17:55:29,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:55:29,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:55:29,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 17:55:29,846 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:55:29,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-16 17:55:29,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:55:30,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-16 17:55:30,194 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:55:30,194 INFO L390 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 2 case distinctions, treesize of input 39 treesize of output 42 [2022-10-16 17:55:30,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:55:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:30,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:30,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1016 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1015))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1016)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1016 1)))))) is different from false [2022-10-16 17:55:30,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1016 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1013)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1015))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1016)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (<= v_ArrVal_1013 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1016 1)))))) is different from false [2022-10-16 17:55:30,535 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1016 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1013)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1015))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1016)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1013) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1016 1)) (< 2147483647 v_ArrVal_1013)))))) is different from false [2022-10-16 17:55:30,558 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1016 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1012))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1013)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1015))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1013) (< 2147483647 v_ArrVal_1013) (< (select (select (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1016)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (select .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1016 1)))))))) is different from false [2022-10-16 17:55:30,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1016 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1012))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1013)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1015))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1013) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1016 1)) (< (select (select (store .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1016)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_1013))))))) is different from false [2022-10-16 17:55:30,671 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1016 Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1010)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1012))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1013)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1015))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1016)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1013) (< 2147483647 v_ArrVal_1013) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1016 1)) (not (<= v_ArrVal_1010 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))))))))) is different from false [2022-10-16 17:55:30,745 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1016 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1010)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1012))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1013)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1015))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1016)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1010) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1013) (< 2147483647 v_ArrVal_1013) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1016 1))))))))) is different from false [2022-10-16 17:55:30,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1016 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1008))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1010)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1012))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1013)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1015))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1010) (< 2147483647 v_ArrVal_1013) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1016 1)) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1013) (< (select (select (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1016)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))))))) is different from false [2022-10-16 17:55:30,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1008 (Array Int Int)) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1016 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1007) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1008))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1010)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1012))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1013)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1015))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (+ 1 (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|)) v_ArrVal_1010) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1013) (< (select .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1016 1)) (< 2147483647 v_ArrVal_1013) (< (select (select (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1016)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))))))) is different from false [2022-10-16 17:55:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-10-16 17:55:31,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355143610] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:55:31,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:55:31,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 37 [2022-10-16 17:55:31,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729973542] [2022-10-16 17:55:31,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:55:31,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-16 17:55:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:31,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-16 17:55:31,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=681, Unknown=13, NotChecked=558, Total=1406 [2022-10-16 17:55:31,014 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 38 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:55:32,508 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-10-16 17:55:32,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 17:55:32,509 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 38 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 17:55:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:55:32,510 INFO L225 Difference]: With dead ends: 65 [2022-10-16 17:55:32,510 INFO L226 Difference]: Without dead ends: 64 [2022-10-16 17:55:32,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=413, Invalid=1400, Unknown=29, NotChecked=810, Total=2652 [2022-10-16 17:55:32,512 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 88 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:55:32,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 83 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 86 Invalid, 0 Unknown, 330 Unchecked, 0.1s Time] [2022-10-16 17:55:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-16 17:55:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2022-10-16 17:55:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-10-16 17:55:32,519 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2022-10-16 17:55:32,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:55:32,520 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-10-16 17:55:32,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 38 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-10-16 17:55:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 17:55:32,521 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:55:32,521 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1] [2022-10-16 17:55:32,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 17:55:32,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 17:55:32,736 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:55:32,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:55:32,737 INFO L85 PathProgramCache]: Analyzing trace with hash 748424239, now seen corresponding path program 2 times [2022-10-16 17:55:32,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:55:32,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287992228] [2022-10-16 17:55:32,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:32,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:55:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:55:33,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287992228] [2022-10-16 17:55:33,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287992228] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:33,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599881334] [2022-10-16 17:55:33,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 17:55:33,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:33,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:55:33,506 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:55:33,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 17:55:33,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 17:55:33,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:55:33,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 17:55:33,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:55:33,753 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-10-16 17:55:33,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-10-16 17:55:33,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:55:33,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:55:33,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:55:33,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:33,887 INFO L356 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2022-10-16 17:55:33,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 103 [2022-10-16 17:55:33,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:33,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:33,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:33,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:33,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:33,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:33,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 73 [2022-10-16 17:55:33,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:34,104 INFO L390 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 59 treesize of output 20 [2022-10-16 17:55:34,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 17:55:34,136 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:34,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:34,168 INFO L356 Elim1Store]: treesize reduction 35, result has 31.4 percent of original size [2022-10-16 17:55:34,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 200 treesize of output 210 [2022-10-16 17:55:34,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:34,347 INFO L356 Elim1Store]: treesize reduction 41, result has 35.9 percent of original size [2022-10-16 17:55:34,348 INFO L390 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 3 case distinctions, treesize of input 87 treesize of output 49 [2022-10-16 17:55:34,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-16 17:55:34,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:55:34,380 INFO L390 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 268 treesize of output 11 [2022-10-16 17:55:34,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-16 17:55:34,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 17:55:34,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 17:55:34,457 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 17:55:34,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-10-16 17:55:34,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:34,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:34,719 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 17:55:34,720 INFO L390 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 1 case distinctions, treesize of input 61 treesize of output 58 [2022-10-16 17:55:34,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:55:34,809 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:55:34,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-16 17:55:34,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:55:34,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:55:35,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 17:55:35,073 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:55:35,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-16 17:55:35,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:55:35,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 17:55:35,310 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:55:35,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-16 17:55:35,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:55:35,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-16 17:55:35,689 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:55:35,689 INFO L390 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 2 case distinctions, treesize of input 39 treesize of output 42 [2022-10-16 17:55:35,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:55:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:35,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:35,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1131 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)))))) is different from false [2022-10-16 17:55:35,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1128 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (not (<= v_ArrVal_1128 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< (select (select (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))) is different from false [2022-10-16 17:55:36,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1128 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1128) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< (select (select (store .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_1128)))))) is different from false [2022-10-16 17:55:36,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1128 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1126))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1128) (< (select (select (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (select .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< 2147483647 v_ArrVal_1128))))))) is different from false [2022-10-16 17:55:36,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1128 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1126))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1128) (< 2147483647 v_ArrVal_1128) (< (select (select (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (select .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)))))))) is different from false [2022-10-16 17:55:36,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1123 Int) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1128 Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1123)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1126))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1128) (not (<= v_ArrVal_1123 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< 2147483647 v_ArrVal_1128))))))) is different from false [2022-10-16 17:55:36,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1123 Int) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1128 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1123)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1126))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1128) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1123) (< 2147483647 v_ArrVal_1128)))))))) is different from false [2022-10-16 17:55:36,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1123 Int) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1128 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1122))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1123)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1126))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1128) (< 2147483647 v_ArrVal_1128) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1123))))))))) is different from false [2022-10-16 17:55:36,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1123 Int) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1128 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1121) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1122))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1123)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1126))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1123) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< (+ 1 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|)) v_ArrVal_1128) (< 2147483647 v_ArrVal_1128))))))))) is different from false [2022-10-16 17:55:36,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1120 Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1123 Int) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1128 Int)) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1120)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1121) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1122))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1123)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1126))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1128) (< (select (select (store .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1123) (< 2147483647 v_ArrVal_1128) (not (<= v_ArrVal_1120 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))))))))))) is different from false [2022-10-16 17:55:36,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1120 Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1123 Int) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1128 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1120)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1121) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1122))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse4 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1123)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1126))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1128) (< (select (select (store .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1120) (< (+ (select .cse4 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1123) (< 2147483647 v_ArrVal_1128)))))))))) is different from false [2022-10-16 17:55:36,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1120 Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1123 Int) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1128 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1118))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1120)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1121) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1122))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse4 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1123)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1126))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1128) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1120) (< (select (select (store .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< 2147483647 v_ArrVal_1128) (< (+ (select .cse4 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1123))))))))))) is different from false [2022-10-16 17:55:36,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1120 Int) (v_ArrVal_1126 (Array Int Int)) (v_ArrVal_1131 Int) (v_ArrVal_1123 Int) (v_ArrVal_1125 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int)) (v_ArrVal_1128 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1117) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1118))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1120)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1121) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1122))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1123)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1125) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1126))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1128)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1129))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1120) (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1131 1)) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1128) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1123) (< (select (select (store .cse4 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1131)) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< 2147483647 v_ArrVal_1128))))))))))) is different from false [2022-10-16 17:55:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 44 not checked. [2022-10-16 17:55:36,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599881334] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:55:36,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:55:36,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 19] total 45 [2022-10-16 17:55:36,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573605112] [2022-10-16 17:55:36,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:55:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-16 17:55:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-16 17:55:36,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=897, Unknown=17, NotChecked=962, Total=2070 [2022-10-16 17:55:36,828 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 46 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 46 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:55:38,523 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-10-16 17:55:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 17:55:38,523 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 46 states have internal predecessors, (96), 0 states have call successors, (0), 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 33 [2022-10-16 17:55:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:55:38,524 INFO L225 Difference]: With dead ends: 54 [2022-10-16 17:55:38,524 INFO L226 Difference]: Without dead ends: 53 [2022-10-16 17:55:38,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=526, Invalid=1845, Unknown=33, NotChecked=1378, Total=3782 [2022-10-16 17:55:38,526 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 100 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 368 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:55:38,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 61 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 108 Invalid, 0 Unknown, 368 Unchecked, 0.1s Time] [2022-10-16 17:55:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-16 17:55:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-10-16 17:55:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 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-10-16 17:55:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-10-16 17:55:38,534 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 33 [2022-10-16 17:55:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:55:38,534 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-10-16 17:55:38,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 46 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-10-16 17:55:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 17:55:38,535 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:55:38,536 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-10-16 17:55:38,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 17:55:38,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 17:55:38,747 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:55:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:55:38,748 INFO L85 PathProgramCache]: Analyzing trace with hash 742698601, now seen corresponding path program 3 times [2022-10-16 17:55:38,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:55:38,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263420055] [2022-10-16 17:55:38,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:38,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:55:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:39,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:55:39,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263420055] [2022-10-16 17:55:39,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263420055] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:39,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288285935] [2022-10-16 17:55:39,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 17:55:39,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:39,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:55:39,565 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:55:39,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 17:55:39,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-16 17:55:39,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:55:39,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 42 conjunts are in the unsatisfiable core [2022-10-16 17:55:39,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:55:39,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-10-16 17:55:39,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:39,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:55:39,769 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:55:39,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-10-16 17:55:39,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:55:39,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:39,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:39,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-16 17:55:39,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:39,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:39,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-16 17:55:39,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:40,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:40,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-16 17:55:40,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:40,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:55:40,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:55:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:40,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:40,133 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1244 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:55:40,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:55:40,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1242 Int) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (<= v_ArrVal_1242 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))))) is different from false [2022-10-16 17:55:40,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1242 Int) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1242)))) is different from false [2022-10-16 17:55:40,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1242 Int) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1240))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1242) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))) is different from false [2022-10-16 17:55:40,227 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1242 Int) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1240 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1240))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (select (select (store (store (store .cse0 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1242))))) is different from false [2022-10-16 17:55:40,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1242 Int) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1237 Int) (v_ArrVal_1240 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1237)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1240))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1242) (not (<= v_ArrVal_1237 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))) is different from false [2022-10-16 17:55:40,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1242 Int) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1237 Int) (v_ArrVal_1240 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1237)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1240))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1237) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1242) (< (select (select (store (store (store .cse2 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647)))))) is different from false [2022-10-16 17:55:40,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1242 Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1237 Int) (v_ArrVal_1240 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1236))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1237)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1240))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1242) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1237))))))) is different from false [2022-10-16 17:55:40,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1242 Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1237 Int) (v_ArrVal_1240 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1235) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1236))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1237)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1240))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1242) (< (select (select (store (store (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1237))))))) is different from false [2022-10-16 17:55:40,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1242 Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1234 Int) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1237 Int) (v_ArrVal_1240 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1234)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1235) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1236))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse2 (store (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1237)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1240))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (not (<= v_ArrVal_1234 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1237) (< (+ 1 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|)) v_ArrVal_1242) (< (select (select (store (store (store .cse2 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))))) is different from false [2022-10-16 17:55:40,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1242 Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1234 Int) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1237 Int) (v_ArrVal_1240 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1234)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1235) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1236))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse3 (store (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1237)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1240))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1237) (< (+ 1 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|)) v_ArrVal_1242) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1234) (< (select (select (store (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647)))))))) is different from false [2022-10-16 17:55:40,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1242 Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1234 Int) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1237 Int) (v_ArrVal_1240 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1232))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1234)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1235) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1236))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse3 (store (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1237)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1240))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1242) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1234) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1237) (< (select (select (store (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))))))) is different from false [2022-10-16 17:55:40,591 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1242 Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1235 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1232 (Array Int Int)) (v_ArrVal_1234 Int) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1231 (Array Int Int)) (v_ArrVal_1237 Int) (v_ArrVal_1240 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1231) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1232))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1234)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1235) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1236))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse3 (store (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1237)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1239) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1240))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1234) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1242) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1237) (< (select (select (store (store (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1242)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))))))) is different from false [2022-10-16 17:55:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2022-10-16 17:55:40,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288285935] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:55:40,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:55:40,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 17] total 33 [2022-10-16 17:55:40,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913143054] [2022-10-16 17:55:40,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:55:40,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 17:55:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:40,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 17:55:40,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=284, Unknown=14, NotChecked=686, Total=1122 [2022-10-16 17:55:40,651 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 34 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 34 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:41,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:55:41,070 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-10-16 17:55:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:55:41,070 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 34 states have internal predecessors, (80), 0 states have call successors, (0), 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 33 [2022-10-16 17:55:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:55:41,071 INFO L225 Difference]: With dead ends: 55 [2022-10-16 17:55:41,071 INFO L226 Difference]: Without dead ends: 54 [2022-10-16 17:55:41,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 19 SemanticMatches, 34 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=334, Unknown=14, NotChecked=742, Total=1260 [2022-10-16 17:55:41,073 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:55:41,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 67 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 94 Invalid, 0 Unknown, 275 Unchecked, 0.1s Time] [2022-10-16 17:55:41,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-16 17:55:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-10-16 17:55:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-10-16 17:55:41,081 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 33 [2022-10-16 17:55:41,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:55:41,081 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-10-16 17:55:41,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 34 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-10-16 17:55:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 17:55:41,083 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:55:41,083 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1] [2022-10-16 17:55:41,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-16 17:55:41,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 17:55:41,297 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:55:41,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:55:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash -287189820, now seen corresponding path program 3 times [2022-10-16 17:55:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:55:41,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241641810] [2022-10-16 17:55:41,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:55:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:55:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:55:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:55:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:55:42,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241641810] [2022-10-16 17:55:42,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241641810] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:55:42,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922218632] [2022-10-16 17:55:42,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 17:55:42,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:55:42,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:55:42,332 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:55:42,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 17:55:42,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-10-16 17:55:42,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:55:42,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 50 conjunts are in the unsatisfiable core [2022-10-16 17:55:42,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:55:42,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 17:55:42,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 49 [2022-10-16 17:55:42,862 INFO L390 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 82 treesize of output 49 [2022-10-16 17:55:43,117 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-10-16 17:55:43,118 INFO L390 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 2 case distinctions, treesize of input 86 treesize of output 76 [2022-10-16 17:55:43,702 INFO L356 Elim1Store]: treesize reduction 26, result has 51.9 percent of original size [2022-10-16 17:55:43,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 123 [2022-10-16 17:55:44,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 35 [2022-10-16 17:55:44,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 37 [2022-10-16 17:55:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-10-16 17:55:44,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:55:48,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse1 (mod .cse3 2))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse4 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse1))))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse1 0) (< (select (select (store .cse2 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse3)) (< 2147483647 v_ArrVal_1352)))))))) is different from false [2022-10-16 17:55:49,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 858 treesize of output 814 [2022-10-16 17:55:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 2 not checked. [2022-10-16 17:55:49,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922218632] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:55:49,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:55:49,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 35 [2022-10-16 17:55:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574093534] [2022-10-16 17:55:49,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:55:49,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-10-16 17:55:49,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:55:49,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-10-16 17:55:49,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1004, Unknown=2, NotChecked=66, Total=1260 [2022-10-16 17:55:49,757 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 36 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 36 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:55:52,036 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse18 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (let ((.cse9 (+ .cse7 2)) (.cse17 (mod .cse18 2)) (.cse6 (< .cse18 0))) (let ((.cse0 (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|)) (.cse11 (not .cse6)) (.cse10 (= .cse7 .cse17)) (.cse5 (not (= .cse17 0))) (.cse4 (= .cse9 .cse17))) (and (not .cse0) (not .cse1) (<= .cse2 2147483647) (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (let ((.cse3 (and (= |c_ULTIMATE.start_f_~count~0#1.offset| |c_ULTIMATE.start_f_~tmp~0#1.offset|) .cse1))) (or (and (or .cse3 .cse4) .cse5 .cse6) (and .cse0 (let ((.cse8 (* (- 1) .cse7))) (or (and (<= 1 (+ .cse7 (* 2 (div (+ .cse8 1) 2)))) (<= 0 .cse7) (< .cse7 2)) (and (<= 0 (+ (* (div (+ (- 1) .cse8) 2) 2) .cse7 1)) (< .cse7 0) (<= 0 .cse9))))) (and (or .cse10 .cse3) .cse11 .cse5))) (not (= .cse7 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (= .cse2 0) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse13 (mod .cse15 2))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse16 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse13))))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse13 0) (< (select (select (store .cse14 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse15)) (< 2147483647 v_ArrVal_1352)))))))) (or (and .cse11 .cse10) (and .cse5 .cse6 .cse4)))))) is different from false [2022-10-16 17:55:54,056 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (and (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (not (= |c_ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (= |c_ULTIMATE.start_f_#t~post11#1| 0) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse2 (mod .cse4 2))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse2))))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse2 0) (< (select (select (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse4)) (< 2147483647 v_ArrVal_1352)))))))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1))) (let ((.cse6 (< .cse8 0)) (.cse7 (mod .cse8 2))) (or (and (not .cse6) (= .cse0 .cse7)) (and (not (= .cse7 0)) .cse6 (= (+ .cse0 2) .cse7))))))) is different from false [2022-10-16 17:55:56,822 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse18 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (let ((.cse9 (+ .cse7 2)) (.cse17 (mod .cse18 2)) (.cse6 (< .cse18 0))) (let ((.cse0 (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|)) (.cse11 (not .cse6)) (.cse10 (= .cse7 .cse17)) (.cse5 (not (= .cse17 0))) (.cse4 (= .cse9 .cse17))) (and (not .cse0) (not .cse1) (<= .cse2 2147483647) (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (let ((.cse3 (and (= |c_ULTIMATE.start_f_~count~0#1.offset| |c_ULTIMATE.start_f_~tmp~0#1.offset|) .cse1))) (or (and (or .cse3 .cse4) .cse5 .cse6) (and .cse0 (let ((.cse8 (* (- 1) .cse7))) (or (and (<= 1 (+ .cse7 (* 2 (div (+ .cse8 1) 2)))) (<= 0 .cse7) (< .cse7 2)) (and (<= 0 (+ (* (div (+ (- 1) .cse8) 2) 2) .cse7 1)) (< .cse7 0) (<= 0 .cse9))))) (and (or .cse10 .cse3) .cse11 .cse5))) (not (= .cse7 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (<= .cse2 1) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse13 (mod .cse15 2))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse16 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse13))))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse13 0) (< (select (select (store .cse14 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse15)) (< 2147483647 v_ArrVal_1352)))))))) (or (and .cse11 .cse10) (and .cse5 .cse6 .cse4)))))) is different from false [2022-10-16 17:55:58,862 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (and (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (not (= |c_ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (<= |c_ULTIMATE.start_f_#t~post11#1| 1) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse2 (mod .cse4 2))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse2))))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse2 0) (< (select (select (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse4)) (< 2147483647 v_ArrVal_1352)))))))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1))) (let ((.cse6 (< .cse8 0)) (.cse7 (mod .cse8 2))) (or (and (not .cse6) (= .cse0 .cse7)) (and (not (= .cse7 0)) .cse6 (= (+ .cse0 2) .cse7))))))) is different from false [2022-10-16 17:56:01,606 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse18 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (let ((.cse9 (+ .cse7 2)) (.cse17 (mod .cse18 2)) (.cse6 (< .cse18 0))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|)) (.cse1 (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse11 (not .cse6)) (.cse10 (= .cse7 .cse17)) (.cse5 (not (= .cse17 0))) (.cse4 (= .cse9 .cse17))) (and (<= .cse0 2) (not .cse1) (not .cse2) (<= .cse0 2147483647) (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (let ((.cse3 (and (= |c_ULTIMATE.start_f_~count~0#1.offset| |c_ULTIMATE.start_f_~tmp~0#1.offset|) .cse2))) (or (and (or .cse3 .cse4) .cse5 .cse6) (and .cse1 (let ((.cse8 (* (- 1) .cse7))) (or (and (<= 1 (+ .cse7 (* 2 (div (+ .cse8 1) 2)))) (<= 0 .cse7) (< .cse7 2)) (and (<= 0 (+ (* (div (+ (- 1) .cse8) 2) 2) .cse7 1)) (< .cse7 0) (<= 0 .cse9))))) (and (or .cse10 .cse3) .cse11 .cse5))) (not (= .cse7 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse13 (mod .cse15 2))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse16 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse13))))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse13 0) (< (select (select (store .cse14 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse15)) (< 2147483647 v_ArrVal_1352)))))))) (or (and .cse11 .cse10) (and .cse5 .cse6 .cse4)))))) is different from false [2022-10-16 17:56:03,637 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (and (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (not (= |c_ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (<= |c_ULTIMATE.start_f_#t~post11#1| 2) (not (= .cse0 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse2 (mod .cse4 2))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse2))))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse2 0) (< (select (select (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse4)) (< 2147483647 v_ArrVal_1352)))))))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1))) (let ((.cse6 (< .cse8 0)) (.cse7 (mod .cse8 2))) (or (and (not .cse6) (= .cse0 .cse7)) (and (not (= .cse7 0)) .cse6 (= (+ .cse0 2) .cse7))))))) is different from false [2022-10-16 17:56:06,436 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse18 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (let ((.cse9 (+ .cse7 2)) (.cse17 (mod .cse18 2)) (.cse6 (< .cse18 0))) (let ((.cse0 (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|)) (.cse11 (not .cse6)) (.cse10 (= .cse7 .cse17)) (.cse5 (not (= .cse17 0))) (.cse4 (= .cse9 .cse17))) (and (not .cse0) (not .cse1) (<= .cse2 2147483647) (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (let ((.cse3 (and (= |c_ULTIMATE.start_f_~count~0#1.offset| |c_ULTIMATE.start_f_~tmp~0#1.offset|) .cse1))) (or (and (or .cse3 .cse4) .cse5 .cse6) (and .cse0 (let ((.cse8 (* (- 1) .cse7))) (or (and (<= 1 (+ .cse7 (* 2 (div (+ .cse8 1) 2)))) (<= 0 .cse7) (< .cse7 2)) (and (<= 0 (+ (* (div (+ (- 1) .cse8) 2) 2) .cse7 1)) (< .cse7 0) (<= 0 .cse9))))) (and (or .cse10 .cse3) .cse11 .cse5))) (not (= .cse7 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (<= .cse2 3) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse13 (mod .cse15 2))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse16 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse13))))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse13 0) (< (select (select (store .cse14 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse15)) (< 2147483647 v_ArrVal_1352)))))))) (or (and .cse11 .cse10) (and .cse5 .cse6 .cse4)))))) is different from false [2022-10-16 17:56:08,484 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (and (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (not (= |c_ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)) (<= |c_ULTIMATE.start_f_#t~post11#1| 3) (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse2 (mod .cse4 2))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse2))))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse2 0) (< (select (select (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse4)) (< 2147483647 v_ArrVal_1352)))))))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1))) (let ((.cse6 (< .cse8 0)) (.cse7 (mod .cse8 2))) (or (and (not .cse6) (= .cse0 .cse7)) (and (not (= .cse7 0)) .cse6 (= (+ .cse0 2) .cse7))))))) is different from false [2022-10-16 17:56:11,322 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 4) (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse2 (mod .cse4 2))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse2))))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse2 0) (< (select (select (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse4)) (< 2147483647 v_ArrVal_1352)))))))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1))) (let ((.cse6 (< .cse8 0)) (.cse7 (mod .cse8 2))) (or (and (not .cse6) (= .cse0 .cse7)) (and (not (= .cse7 0)) .cse6 (= (+ .cse0 2) .cse7))))))) is different from false [2022-10-16 17:56:13,329 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (and (<= |c_ULTIMATE.start_f_#t~post11#1| 4) (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse2 (mod .cse4 2))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse2))))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse2 0) (< (select (select (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse4)) (< 2147483647 v_ArrVal_1352)))))))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1))) (let ((.cse6 (< .cse8 0)) (.cse7 (mod .cse8 2))) (or (and (not .cse6) (= .cse0 .cse7)) (and (not (= .cse7 0)) .cse6 (= (+ .cse0 2) .cse7))))))) is different from false [2022-10-16 17:56:15,746 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (and (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (exists ((|ULTIMATE.start_f_~tmp~0#1.offset| Int) (aux_div_v_arrayElimCell_298_27 Int) (|ULTIMATE.start_f_~tmp~0#1.base| Int)) (let ((.cse2 (select (select |c_#memory_int| |ULTIMATE.start_f_~tmp~0#1.base|) |ULTIMATE.start_f_~tmp~0#1.offset|))) (let ((.cse1 (+ (* 2 aux_div_v_arrayElimCell_298_27) .cse2))) (and (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 1) .cse1) (<= 0 .cse2) (<= .cse1 2147483647) (< 1 .cse1) (not (= .cse2 0)) (< .cse2 2) (not (= |ULTIMATE.start_f_~tmp~0#1.base| |c_ULTIMATE.start_f_~count~0#1.base|)))))) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse4 (mod .cse6 2))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse7 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse4))))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse4 0) (< (select (select (store .cse5 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse6)) (< 2147483647 v_ArrVal_1352)))))))) (let ((.cse10 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1))) (let ((.cse8 (< .cse10 0)) (.cse9 (mod .cse10 2))) (or (and (not .cse8) (= .cse0 .cse9)) (and (not (= .cse9 0)) .cse8 (= (+ .cse0 2) .cse9))))))) is different from false [2022-10-16 17:56:17,753 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (and (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse2 (mod .cse4 2))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse2))))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse2 0) (< (select (select (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse4)) (< 2147483647 v_ArrVal_1352)))))))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1))) (let ((.cse6 (< .cse8 0)) (.cse7 (mod .cse8 2))) (or (and (not .cse6) (= .cse0 .cse7)) (and (not (= .cse7 0)) .cse6 (= (+ .cse0 2) .cse7))))))) is different from false [2022-10-16 17:56:19,759 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset|))) (and (= |c_ULTIMATE.start_f_~count~0#1.offset| 0) (not (= .cse0 0)) (= |c_ULTIMATE.start_f_~a_ref~0#1.offset| 0) (<= |c_ULTIMATE.start_f_#t~post11#1| 2147483646) (not (= |c_ULTIMATE.start_f_~a_ref~0#1.base| |c_ULTIMATE.start_f_~tmp~0#1.base|)) (forall ((v_ArrVal_1352 Int) (|ULTIMATE.start_f_~count~0#1.base| Int) (v_ArrVal_1357 Int)) (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1352)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|))) (let ((.cse2 (mod .cse4 2))) (let ((.cse3 (store .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse5 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| (+ (- 2) .cse2))))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base|))) (or (< (select .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset|) (+ v_ArrVal_1357 1)) (= .cse2 0) (< (select (select (store .cse3 |c_ULTIMATE.start_f_~a_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~a_ref~0#1.offset| v_ArrVal_1357)) |ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (not (< 1 .cse4)) (< 2147483647 v_ArrVal_1352)))))))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base|) |c_ULTIMATE.start_f_~a_ref~0#1.offset|) 1))) (let ((.cse6 (< .cse8 0)) (.cse7 (mod .cse8 2))) (or (and (not .cse6) (= .cse0 .cse7)) (and (not (= .cse7 0)) .cse6 (= (+ .cse0 2) .cse7))))))) is different from false [2022-10-16 17:56:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:56:19,763 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-10-16 17:56:19,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-10-16 17:56:19,763 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 36 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 17:56:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:56:19,764 INFO L225 Difference]: With dead ends: 132 [2022-10-16 17:56:19,764 INFO L226 Difference]: Without dead ends: 97 [2022-10-16 17:56:19,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=977, Invalid=4466, Unknown=15, NotChecked=2198, Total=7656 [2022-10-16 17:56:19,767 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 118 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:56:19,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 50 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 148 Invalid, 0 Unknown, 358 Unchecked, 0.3s Time] [2022-10-16 17:56:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-10-16 17:56:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2022-10-16 17:56:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-10-16 17:56:19,780 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 41 [2022-10-16 17:56:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:56:19,780 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-10-16 17:56:19,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 36 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-10-16 17:56:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 17:56:19,781 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:56:19,782 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2022-10-16 17:56:19,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-10-16 17:56:19,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:19,983 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:56:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:56:19,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1220127886, now seen corresponding path program 4 times [2022-10-16 17:56:19,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:56:19,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761505677] [2022-10-16 17:56:19,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:19,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:56:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:21,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:56:21,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761505677] [2022-10-16 17:56:21,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761505677] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:56:21,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071589120] [2022-10-16 17:56:21,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 17:56:21,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:21,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:56:21,113 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:56:21,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 17:56:21,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 17:56:21,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:56:21,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 17:56:21,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:56:21,370 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-10-16 17:56:21,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-10-16 17:56:21,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:56:21,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:56:21,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:56:21,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:56:21,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:56:21,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:56:21,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:56:21,766 INFO L390 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 60 treesize of output 21 [2022-10-16 17:56:21,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:56:21,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:56:21,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:56:21,795 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-10-16 17:56:21,796 INFO L390 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 3 case distinctions, treesize of input 210 treesize of output 177 [2022-10-16 17:56:21,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-16 17:56:21,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-10-16 17:56:22,545 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-10-16 17:56:22,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 820 treesize of output 771 [2022-10-16 17:56:22,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-10-16 17:56:22,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:56:22,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:56:22,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-10-16 17:56:22,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:56:22,884 INFO L390 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 29 treesize of output 29 [2022-10-16 17:56:22,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:56:23,084 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:56:23,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-16 17:56:23,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 17:56:23,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:56:23,276 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:56:23,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-16 17:56:23,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 17:56:23,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:56:23,486 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:56:23,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-16 17:56:23,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 17:56:23,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:56:23,701 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-16 17:56:23,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-10-16 17:56:23,882 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-10-16 17:56:23,883 INFO L390 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 2 case distinctions, treesize of input 21 treesize of output 30 [2022-10-16 17:56:23,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 17:56:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:23,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:56:24,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1484 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:56:24,070 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 Int) (v_ArrVal_1484 (Array Int Int))) (or (< 0 v_ArrVal_1483) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483)) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))) is different from false [2022-10-16 17:56:24,093 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1483 Int) (v_ArrVal_1484 (Array Int Int))) (or (< 0 v_ArrVal_1483) (not (<= v_ArrVal_1481 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))) is different from false [2022-10-16 17:56:24,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1483 Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< 0 v_ArrVal_1483) (< (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse1 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse1 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647)))) is different from false [2022-10-16 17:56:24,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< 0 v_ArrVal_1483))))) is different from false [2022-10-16 17:56:24,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< 0 v_ArrVal_1483))))) is different from false [2022-10-16 17:56:24,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1477 Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< 0 v_ArrVal_1483) (not (<= v_ArrVal_1477 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481))))) is different from false [2022-10-16 17:56:24,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1477 Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< 0 v_ArrVal_1483) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481)))))) is different from false [2022-10-16 17:56:24,335 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1477 Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1475))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse3 (store (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< 0 v_ArrVal_1483) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477) (< (select (select (store (let ((.cse2 (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse2 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse2 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))))) is different from false [2022-10-16 17:56:24,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1477 Int) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1484 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1474) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1475))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse2 (store (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477) (< (select (select (store (let ((.cse1 (store .cse2 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse1 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse1 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< 0 v_ArrVal_1483))))))) is different from false [2022-10-16 17:56:24,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1472 Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1477 Int) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1484 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1472)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1474) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1475))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse1 (store (store (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (not (<= v_ArrVal_1472 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< 0 v_ArrVal_1483) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477))))))) is different from false [2022-10-16 17:56:24,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1472 Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1477 Int) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1484 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1472)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1474) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1475))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse1 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse4 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1472) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< 0 v_ArrVal_1483) (< (+ (select .cse4 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477)))))))) is different from false [2022-10-16 17:56:24,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1472 Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1477 Int) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1484 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1471))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse4 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1472)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1474) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1475))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse3 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477) (< 0 v_ArrVal_1483) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< (select (select (store (let ((.cse2 (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse2 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse2 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1472))))))))) is different from false [2022-10-16 17:56:24,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1472 Int) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1477 Int) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1484 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1470) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1471))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1472)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1474) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1475))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477) (< 0 v_ArrVal_1483) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1472) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< (select (select (store (let ((.cse3 (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse3 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse3 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647))))))))) is different from false [2022-10-16 17:56:24,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1484 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_ArrVal_1481 Int) (v_ArrVal_1472 Int) (v_ArrVal_1483 Int) (v_ArrVal_1477 Int) (v_ArrVal_1469 Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1469)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1470) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1471))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse5 (store (store (store .cse6 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1472)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1474) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1475))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse3 (store (store (store .cse5 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse4 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1472) (< (select (select (store (let ((.cse2 (store .cse3 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse2 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse2 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< 0 v_ArrVal_1483) (< (+ (select .cse4 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477) (not (<= v_ArrVal_1469 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))))))))))) is different from false [2022-10-16 17:56:24,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1484 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_ArrVal_1481 Int) (v_ArrVal_1472 Int) (v_ArrVal_1483 Int) (v_ArrVal_1477 Int) (v_ArrVal_1469 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1469)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1470) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1471))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1472)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1474) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1475))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse4 (store (store (store .cse6 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse5 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1469) (< (+ (select .cse1 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1472) (< (select (select (store (let ((.cse3 (store .cse4 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse1 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse3 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse3 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< 0 v_ArrVal_1483) (< (+ (select .cse5 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477)))))))))) is different from false [2022-10-16 17:56:24,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1484 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_ArrVal_1481 Int) (v_ArrVal_1472 Int) (v_ArrVal_1483 Int) (v_ArrVal_1477 Int) (v_ArrVal_1469 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1467))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse7 (store (store (store .cse8 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1469)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1470) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1471))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse5 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1472)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1474) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1475))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse1 (store (store (store .cse6 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse4 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< 0 v_ArrVal_1483) (< (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1469) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< (+ (select .cse4 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477) (< (+ (select .cse5 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1472))))))))))) is different from false [2022-10-16 17:56:25,052 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1484 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_ArrVal_1470 (Array Int Int)) (v_ArrVal_1481 Int) (v_ArrVal_1472 Int) (v_ArrVal_1483 Int) (v_ArrVal_1477 Int) (v_ArrVal_1469 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1466) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1467))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse7 (store (store (store .cse8 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse0 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1469)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1470) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1471))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse6 (store (store (store .cse7 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse5 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1472)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1474) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1475))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_f_~count~0#1.base|))) (let ((.cse2 (store (store (store .cse6 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse4 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1469) (< (select (select (store (let ((.cse1 (store .cse2 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse3 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse1 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse1 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< 0 v_ArrVal_1483) (< (+ (select .cse4 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1477) (< (+ (select .cse3 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481) (< (+ (select .cse5 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1472))))))))))) (not (< 1 |c_ULTIMATE.start_f_#t~mem5#1|))) is different from false [2022-10-16 17:56:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 64 not checked. [2022-10-16 17:56:25,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071589120] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:56:25,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:56:25,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 23] total 52 [2022-10-16 17:56:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022755082] [2022-10-16 17:56:25,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:56:25,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-10-16 17:56:25,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:56:25,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-10-16 17:56:25,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1018, Unknown=22, NotChecked=1494, Total=2756 [2022-10-16 17:56:25,304 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 53 states, 52 states have (on average 2.3076923076923075) internal successors, (120), 53 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:33,405 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_f_#t~post11#1| 2147483646) (forall ((v_ArrVal_1481 Int) (v_ArrVal_1479 (Array Int Int)) (v_ArrVal_1478 (Array Int Int)) (v_ArrVal_1483 Int) (v_ArrVal_1477 Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1477)) |c_ULTIMATE.start_f_~tmp~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1479))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_f_~count~0#1.base|))) (or (< (select (select (store (let ((.cse0 (store .cse1 |c_ULTIMATE.start_f_~count~0#1.base| (store .cse2 |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647) (< 0 v_ArrVal_1483) (not (<= v_ArrVal_1477 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< (+ (select .cse2 |c_ULTIMATE.start_f_~count~0#1.offset|) 1) v_ArrVal_1481)))))) is different from false [2022-10-16 17:56:33,414 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_f_#t~post11#1| 2147483646) (forall ((v_ArrVal_1481 Int) (v_ArrVal_1483 Int) (v_ArrVal_1484 (Array Int Int))) (or (< 0 v_ArrVal_1483) (not (<= v_ArrVal_1481 (+ |c_ULTIMATE.start_f_#t~post11#1| 1))) (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset| v_ArrVal_1481)))) (store .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base| (store (select .cse0 |c_ULTIMATE.start_f_~tmp~0#1.base|) |c_ULTIMATE.start_f_~tmp~0#1.offset| v_ArrVal_1483))) |c_ULTIMATE.start_f_~a_ref~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_f_~count~0#1.base|) |c_ULTIMATE.start_f_~count~0#1.offset|) 2147483647)))) is different from false [2022-10-16 17:56:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:56:33,451 INFO L93 Difference]: Finished difference Result 188 states and 207 transitions. [2022-10-16 17:56:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-10-16 17:56:33,452 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.3076923076923075) internal successors, (120), 53 states have internal predecessors, (120), 0 states have call successors, (0), 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 41 [2022-10-16 17:56:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:56:33,453 INFO L225 Difference]: With dead ends: 188 [2022-10-16 17:56:33,454 INFO L226 Difference]: Without dead ends: 187 [2022-10-16 17:56:33,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 55 SyntacticMatches, 14 SemanticMatches, 76 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=723, Invalid=2621, Unknown=42, NotChecked=2620, Total=6006 [2022-10-16 17:56:33,457 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 67 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 368 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:56:33,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 99 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 89 Invalid, 0 Unknown, 368 Unchecked, 0.1s Time] [2022-10-16 17:56:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-10-16 17:56:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2022-10-16 17:56:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.1111111111111112) internal successors, (190), 171 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 190 transitions. [2022-10-16 17:56:33,480 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 190 transitions. Word has length 41 [2022-10-16 17:56:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:56:33,480 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 190 transitions. [2022-10-16 17:56:33,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.3076923076923075) internal successors, (120), 53 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:56:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 190 transitions. [2022-10-16 17:56:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 17:56:33,481 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:56:33,481 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2022-10-16 17:56:33,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-16 17:56:33,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:33,689 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:56:33,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:56:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1853847922, now seen corresponding path program 5 times [2022-10-16 17:56:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:56:33,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545896108] [2022-10-16 17:56:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:56:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:56:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:56:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:34,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:56:34,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545896108] [2022-10-16 17:56:34,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545896108] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:56:34,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737103361] [2022-10-16 17:56:34,764 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 17:56:34,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:56:34,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:56:34,766 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 17:56:34,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 17:56:34,943 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-10-16 17:56:34,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:56:34,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 91 conjunts are in the unsatisfiable core [2022-10-16 17:56:34,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:56:35,073 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-10-16 17:56:35,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-10-16 17:56:35,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:56:35,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:56:35,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-10-16 17:56:35,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:56:35,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:56:35,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:56:35,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 85 treesize of output 78 [2022-10-16 17:56:35,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:56:35,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:56:35,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 17:56:35,279 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-10-16 17:56:35,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 101 [2022-10-16 17:56:35,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:56:35,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:56:35,357 INFO L356 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-10-16 17:56:35,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 97 [2022-10-16 17:56:35,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-16 17:56:35,856 INFO L356 Elim1Store]: treesize reduction 34, result has 50.7 percent of original size [2022-10-16 17:56:35,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 500 treesize of output 493 [2022-10-16 17:56:35,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:56:36,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:56:36,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 17:56:36,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:56:36,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 46 [2022-10-16 17:56:36,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2022-10-16 17:56:36,553 INFO L356 Elim1Store]: treesize reduction 105, result has 33.5 percent of original size [2022-10-16 17:56:36,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 91 treesize of output 103 [2022-10-16 17:56:36,966 INFO L356 Elim1Store]: treesize reduction 59, result has 28.0 percent of original size [2022-10-16 17:56:36,967 INFO L390 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 7 case distinctions, treesize of input 72 treesize of output 73 [2022-10-16 17:56:37,331 INFO L356 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2022-10-16 17:56:37,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 58 [2022-10-16 17:56:37,622 INFO L356 Elim1Store]: treesize reduction 87, result has 23.0 percent of original size [2022-10-16 17:56:37,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 55 treesize of output 52 [2022-10-16 17:56:37,847 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:56:37,847 INFO L390 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 2 case distinctions, treesize of input 35 treesize of output 38 [2022-10-16 17:56:38,065 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-10-16 17:56:38,066 INFO L390 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 2 case distinctions, treesize of input 45 treesize of output 58 [2022-10-16 17:56:38,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:56:38,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-16 17:56:38,261 INFO L390 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 39 treesize of output 30 [2022-10-16 17:56:38,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:56:38,529 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:56:38,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-16 17:56:38,647 INFO L390 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 32 treesize of output 27 [2022-10-16 17:56:38,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:56:38,941 INFO L356 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2022-10-16 17:56:38,941 INFO L390 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 1 case distinctions, treesize of input 36 treesize of output 38 [2022-10-16 17:56:39,193 INFO L356 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2022-10-16 17:56:39,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 45 [2022-10-16 17:56:39,430 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:56:39,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-10-16 17:56:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 60 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:56:39,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:57:51,371 WARN L233 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 109 DAG size of output: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)