/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/java_Continue1-alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 17:57:07,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 17:57:07,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 17:57:07,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 17:57:07,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 17:57:07,916 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 17:57:07,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 17:57:07,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 17:57:07,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 17:57:07,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 17:57:07,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 17:57:07,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 17:57:07,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 17:57:07,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 17:57:07,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 17:57:07,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 17:57:07,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 17:57:07,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 17:57:07,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 17:57:07,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 17:57:07,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 17:57:07,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 17:57:07,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 17:57:07,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 17:57:08,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 17:57:08,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 17:57:08,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 17:57:08,011 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 17:57:08,012 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 17:57:08,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 17:57:08,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 17:57:08,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 17:57:08,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 17:57:08,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 17:57:08,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 17:57:08,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 17:57:08,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 17:57:08,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 17:57:08,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 17:57:08,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 17:57:08,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 17:57:08,026 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:57:08,084 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 17:57:08,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 17:57:08,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 17:57:08,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 17:57:08,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 17:57:08,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 17:57:08,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 17:57:08,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 17:57:08,092 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 17:57:08,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 17:57:08,093 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 17:57:08,094 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 17:57:08,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 17:57:08,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 17:57:08,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 17:57:08,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 17:57:08,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 17:57:08,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 17:57:08,095 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 17:57:08,095 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 17:57:08,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 17:57:08,096 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 17:57:08,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 17:57:08,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 17:57:08,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 17:57:08,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 17:57:08,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:57:08,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 17:57:08,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 17:57:08,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 17:57:08,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 17:57:08,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 17:57:08,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 17:57:08,098 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:57:08,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 17:57:08,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 17:57:08,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 17:57:08,615 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 17:57:08,616 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 17:57:08,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2022-10-16 17:57:08,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6a9da12f/55a372d3b55a484ebc9e8eafe5f250a2/FLAGba1053afc [2022-10-16 17:57:09,378 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 17:57:09,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2022-10-16 17:57:09,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6a9da12f/55a372d3b55a484ebc9e8eafe5f250a2/FLAGba1053afc [2022-10-16 17:57:09,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6a9da12f/55a372d3b55a484ebc9e8eafe5f250a2 [2022-10-16 17:57:09,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 17:57:09,683 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 17:57:09,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 17:57:09,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 17:57:09,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 17:57:09,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:57:09" (1/1) ... [2022-10-16 17:57:09,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@776eab1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:09, skipping insertion in model container [2022-10-16 17:57:09,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:57:09" (1/1) ... [2022-10-16 17:57:09,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 17:57:09,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 17:57:10,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:57:10,072 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 17:57:10,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 17:57:10,165 INFO L208 MainTranslator]: Completed translation [2022-10-16 17:57:10,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10 WrapperNode [2022-10-16 17:57:10,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 17:57:10,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 17:57:10,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 17:57:10,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 17:57:10,181 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:57:10" (1/1) ... [2022-10-16 17:57:10,217 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:57:10" (1/1) ... [2022-10-16 17:57:10,251 INFO L138 Inliner]: procedures = 109, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 49 [2022-10-16 17:57:10,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 17:57:10,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 17:57:10,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 17:57:10,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 17:57:10,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10" (1/1) ... [2022-10-16 17:57:10,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10" (1/1) ... [2022-10-16 17:57:10,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10" (1/1) ... [2022-10-16 17:57:10,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10" (1/1) ... [2022-10-16 17:57:10,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10" (1/1) ... [2022-10-16 17:57:10,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10" (1/1) ... [2022-10-16 17:57:10,309 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10" (1/1) ... [2022-10-16 17:57:10,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10" (1/1) ... [2022-10-16 17:57:10,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 17:57:10,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 17:57:10,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 17:57:10,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 17:57:10,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10" (1/1) ... [2022-10-16 17:57:10,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 17:57:10,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:57:10,363 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:57:10,390 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:57:10,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 17:57:10,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 17:57:10,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 17:57:10,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 17:57:10,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 17:57:10,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 17:57:10,560 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 17:57:10,562 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 17:57:10,783 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 17:57:10,790 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 17:57:10,791 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-16 17:57:10,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:57:10 BoogieIcfgContainer [2022-10-16 17:57:10,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 17:57:10,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 17:57:10,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 17:57:10,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 17:57:10,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:57:09" (1/3) ... [2022-10-16 17:57:10,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e89366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:57:10, skipping insertion in model container [2022-10-16 17:57:10,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:57:10" (2/3) ... [2022-10-16 17:57:10,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e89366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:57:10, skipping insertion in model container [2022-10-16 17:57:10,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:57:10" (3/3) ... [2022-10-16 17:57:10,850 INFO L112 eAbstractionObserver]: Analyzing ICFG java_Continue1-alloca.i [2022-10-16 17:57:10,910 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 17:57:10,910 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-10-16 17:57:11,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 17:57:11,015 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;@18a8c741, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 17:57:11,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-10-16 17:57:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:57:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 17:57:11,042 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:11,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 17:57:11,045 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash 889536581, now seen corresponding path program 1 times [2022-10-16 17:57:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:11,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880411911] [2022-10-16 17:57:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:11,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:11,459 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:57:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:11,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880411911] [2022-10-16 17:57:11,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880411911] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:57:11,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:57:11,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 17:57:11,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130973147] [2022-10-16 17:57:11,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:57:11,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 17:57:11,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:11,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 17:57:11,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 17:57:11,510 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:11,558 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-10-16 17:57:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 17:57:11,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 17:57:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:11,571 INFO L225 Difference]: With dead ends: 22 [2022-10-16 17:57:11,572 INFO L226 Difference]: Without dead ends: 13 [2022-10-16 17:57:11,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 17:57:11,581 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:11,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:57:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-10-16 17:57:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-10-16 17:57:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-10-16 17:57:11,619 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 6 [2022-10-16 17:57:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:11,619 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-10-16 17:57:11,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-10-16 17:57:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 17:57:11,621 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:11,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:57:11,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 17:57:11,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:11,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1805830281, now seen corresponding path program 1 times [2022-10-16 17:57:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:11,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575295922] [2022-10-16 17:57:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:11,947 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:57:11,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:11,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575295922] [2022-10-16 17:57:11,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575295922] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:57:11,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:57:11,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 17:57:11,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745647134] [2022-10-16 17:57:11,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:57:11,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 17:57:11,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:11,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 17:57:11,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 17:57:11,956 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:12,029 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-10-16 17:57:12,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 17:57:12,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 17:57:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:12,031 INFO L225 Difference]: With dead ends: 19 [2022-10-16 17:57:12,031 INFO L226 Difference]: Without dead ends: 18 [2022-10-16 17:57:12,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:57:12,034 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:12,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:57:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-10-16 17:57:12,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-10-16 17:57:12,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-10-16 17:57:12,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 7 [2022-10-16 17:57:12,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:12,041 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-10-16 17:57:12,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:12,042 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-10-16 17:57:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 17:57:12,042 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:12,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:57:12,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 17:57:12,043 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash 236114091, now seen corresponding path program 1 times [2022-10-16 17:57:12,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:12,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015690265] [2022-10-16 17:57:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:12,306 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:57:12,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:12,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015690265] [2022-10-16 17:57:12,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015690265] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:57:12,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:57:12,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 17:57:12,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316823049] [2022-10-16 17:57:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:57:12,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:57:12,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:12,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:57:12,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:57:12,310 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:57:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:12,358 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-10-16 17:57:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 17:57:12,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:57:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:12,359 INFO L225 Difference]: With dead ends: 30 [2022-10-16 17:57:12,360 INFO L226 Difference]: Without dead ends: 19 [2022-10-16 17:57:12,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:57:12,362 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:12,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:57:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-10-16 17:57:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-10-16 17:57:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:57:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-10-16 17:57:12,369 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 9 [2022-10-16 17:57:12,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:12,370 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-10-16 17:57:12,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:57:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-10-16 17:57:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 17:57:12,371 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:12,371 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-16 17:57:12,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 17:57:12,372 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:12,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1083827793, now seen corresponding path program 1 times [2022-10-16 17:57:12,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:12,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644464315] [2022-10-16 17:57:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:57:12,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:12,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644464315] [2022-10-16 17:57:12,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644464315] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:57:12,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:57:12,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 17:57:12,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235104367] [2022-10-16 17:57:12,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:57:12,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 17:57:12,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:12,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 17:57:12,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 17:57:12,664 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 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:57:12,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:12,704 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-10-16 17:57:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 17:57:12,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-10-16 17:57:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:12,706 INFO L225 Difference]: With dead ends: 19 [2022-10-16 17:57:12,706 INFO L226 Difference]: Without dead ends: 18 [2022-10-16 17:57:12,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:57:12,709 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:12,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:57:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-10-16 17:57:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-10-16 17:57:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-10-16 17:57:12,716 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2022-10-16 17:57:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:12,716 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-10-16 17:57:12,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 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:57:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-10-16 17:57:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 17:57:12,717 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:12,718 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-16 17:57:12,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 17:57:12,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2118545489, now seen corresponding path program 1 times [2022-10-16 17:57:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:12,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001277822] [2022-10-16 17:57:12,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:12,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:13,180 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:57:13,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:13,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001277822] [2022-10-16 17:57:13,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001277822] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:57:13,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790190445] [2022-10-16 17:57:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:13,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:13,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:57:13,187 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:57:13,208 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:57:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:13,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 27 conjunts are in the unsatisfiable core [2022-10-16 17:57:13,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:57:13,371 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-10-16 17:57:13,372 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-10-16 17:57:13,413 INFO L356 Elim1Store]: treesize reduction 39, result has 26.4 percent of original size [2022-10-16 17:57:13,414 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 3 case distinctions, treesize of input 46 treesize of output 67 [2022-10-16 17:57:13,442 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:57:13,525 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:57:13,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-10-16 17:57:13,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 41 [2022-10-16 17:57:13,625 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:57:13,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:57:13,721 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-10-16 17:57:13,832 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:57:13,837 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:57:13,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:57:13,962 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:57:13,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790190445] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:57:13,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:57:13,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-10-16 17:57:13,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915606870] [2022-10-16 17:57:13,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:57:13,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 17:57:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:13,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 17:57:13,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:57:13,975 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:14,197 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-10-16 17:57:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 17:57:14,198 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 17:57:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:14,199 INFO L225 Difference]: With dead ends: 43 [2022-10-16 17:57:14,199 INFO L226 Difference]: Without dead ends: 33 [2022-10-16 17:57:14,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2022-10-16 17:57:14,202 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:14,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 45 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:57:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-16 17:57:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-16 17:57:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:57:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-10-16 17:57:14,211 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 14 [2022-10-16 17:57:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:14,211 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-10-16 17:57:14,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-10-16 17:57:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 17:57:14,213 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:14,213 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2022-10-16 17:57:14,256 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:57:14,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:14,428 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:14,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:14,429 INFO L85 PathProgramCache]: Analyzing trace with hash -396898261, now seen corresponding path program 2 times [2022-10-16 17:57:14,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:14,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590019958] [2022-10-16 17:57:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:57:15,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:15,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590019958] [2022-10-16 17:57:15,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590019958] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:57:15,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892481732] [2022-10-16 17:57:15,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 17:57:15,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:15,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:57:15,194 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:57:15,218 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:57:15,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 17:57:15,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:57:15,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 42 conjunts are in the unsatisfiable core [2022-10-16 17:57:15,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:57:15,317 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-10-16 17:57:15,318 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-10-16 17:57:15,351 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-10-16 17:57:15,352 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 3 case distinctions, treesize of input 46 treesize of output 71 [2022-10-16 17:57:15,364 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:57:15,391 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:57:15,429 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:57:15,460 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 23 treesize of output 16 [2022-10-16 17:57:15,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-16 17:57:15,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-16 17:57:15,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-16 17:57:15,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-10-16 17:57:15,837 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:57:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:57:15,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:57:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:57:16,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892481732] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:57:16,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:57:16,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 37 [2022-10-16 17:57:16,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819933859] [2022-10-16 17:57:16,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:57:16,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-10-16 17:57:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:16,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-10-16 17:57:16,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2022-10-16 17:57:16,085 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:16,484 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-10-16 17:57:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 17:57:16,485 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-16 17:57:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:16,486 INFO L225 Difference]: With dead ends: 73 [2022-10-16 17:57:16,486 INFO L226 Difference]: Without dead ends: 63 [2022-10-16 17:57:16,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2022-10-16 17:57:16,489 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:16,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 57 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:57:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-16 17:57:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-10-16 17:57:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 62 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:57:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-10-16 17:57:16,500 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 29 [2022-10-16 17:57:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:16,501 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-10-16 17:57:16,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-10-16 17:57:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-16 17:57:16,503 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:16,503 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1, 1, 1] [2022-10-16 17:57:16,548 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:57:16,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-16 17:57:16,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:16,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:16,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1735448725, now seen corresponding path program 3 times [2022-10-16 17:57:16,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:16,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463067972] [2022-10-16 17:57:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-10-16 17:57:17,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:17,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463067972] [2022-10-16 17:57:17,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463067972] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:57:17,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534807738] [2022-10-16 17:57:17,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 17:57:17,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:17,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:57:17,229 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:57:17,242 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:57:17,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-10-16 17:57:17,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:57:17,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2022-10-16 17:57:17,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:57:17,470 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-10-16 17:57:17,470 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-10-16 17:57:17,477 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:57:17,485 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:57:17,505 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 42 treesize of output 15 [2022-10-16 17:57:17,508 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:57:17,538 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:57:17,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, 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:57:17,611 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:57:17,635 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:57:17,661 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:57:17,684 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:57:17,709 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:57:17,732 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:57:17,754 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:57:17,779 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:57:17,803 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:57:17,831 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:57:17,846 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:57:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-10-16 17:57:17,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:57:17,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_226 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:57:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 10 not checked. [2022-10-16 17:57:18,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534807738] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:57:18,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:57:18,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-10-16 17:57:18,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89817850] [2022-10-16 17:57:18,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:57:18,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 17:57:18,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:18,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 17:57:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=62, Unknown=1, NotChecked=16, Total=110 [2022-10-16 17:57:18,130 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:18,184 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-10-16 17:57:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 17:57:18,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-10-16 17:57:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:18,187 INFO L225 Difference]: With dead ends: 77 [2022-10-16 17:57:18,187 INFO L226 Difference]: Without dead ends: 75 [2022-10-16 17:57:18,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=72, Unknown=1, NotChecked=18, Total=132 [2022-10-16 17:57:18,188 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:18,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-10-16 17:57:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-16 17:57:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-10-16 17:57:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 69 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:57:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2022-10-16 17:57:18,199 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 59 [2022-10-16 17:57:18,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:18,200 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2022-10-16 17:57:18,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2022-10-16 17:57:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 17:57:18,203 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:18,203 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 10, 2, 2, 1, 1, 1, 1, 1] [2022-10-16 17:57:18,246 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:57:18,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:18,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:18,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:18,419 INFO L85 PathProgramCache]: Analyzing trace with hash 39543553, now seen corresponding path program 1 times [2022-10-16 17:57:18,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:18,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161141359] [2022-10-16 17:57:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-10-16 17:57:19,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:19,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161141359] [2022-10-16 17:57:19,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161141359] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:57:19,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181283476] [2022-10-16 17:57:19,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:19,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:19,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:57:19,318 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:57:19,340 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:57:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:19,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 17:57:19,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:57:19,446 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:57:19,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 17:57:19,453 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 14 [2022-10-16 17:57:19,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 17:57:19,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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 17:57:19,510 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:57:19,535 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:57:19,558 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:57:19,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, 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:57:19,609 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:57:19,637 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:57:19,663 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:57:19,688 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:57:19,712 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:57:19,737 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:57:19,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 28 treesize of output 16 [2022-10-16 17:57:19,803 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:57:19,814 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:57:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-10-16 17:57:19,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:57:19,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_320 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:57:19,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int)) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_318 (+ |c_ULTIMATE.start_main_#t~post9#1| 1))))) is different from false [2022-10-16 17:57:19,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_318)))) is different from false [2022-10-16 17:57:19,911 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_320 (Array Int Int)) (v_ArrVal_318 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_317))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_318) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_318)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))))) is different from false [2022-10-16 17:57:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 67 not checked. [2022-10-16 17:57:20,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181283476] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:57:20,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:57:20,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2022-10-16 17:57:20,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724073710] [2022-10-16 17:57:20,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:57:20,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 17:57:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:20,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 17:57:20,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=76, Unknown=4, NotChecked=84, Total=210 [2022-10-16 17:57:20,456 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 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:57:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:20,563 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-10-16 17:57:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 17:57:20,563 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-10-16 17:57:20,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:20,564 INFO L225 Difference]: With dead ends: 78 [2022-10-16 17:57:20,564 INFO L226 Difference]: Without dead ends: 77 [2022-10-16 17:57:20,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=102, Unknown=4, NotChecked=100, Total=272 [2022-10-16 17:57:20,566 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:20,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 43 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 53 Unchecked, 0.0s Time] [2022-10-16 17:57:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-16 17:57:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-10-16 17:57:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 76 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:57:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-10-16 17:57:20,577 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 67 [2022-10-16 17:57:20,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:20,578 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-10-16 17:57:20,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 15 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:57:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-10-16 17:57:20,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-16 17:57:20,579 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:20,580 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 10, 2, 2, 2, 1, 1, 1, 1] [2022-10-16 17:57:20,616 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:57:20,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:20,794 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:20,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1225850198, now seen corresponding path program 1 times [2022-10-16 17:57:20,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:20,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478953461] [2022-10-16 17:57:20,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-10-16 17:57:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:21,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478953461] [2022-10-16 17:57:21,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478953461] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:57:21,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666362401] [2022-10-16 17:57:21,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:21,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:21,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:57:21,460 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:57:21,479 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:57:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:21,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-16 17:57:21,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:57:21,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 17:57:21,845 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:57:21,845 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 28 treesize of output 35 [2022-10-16 17:57:22,064 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:57:22,065 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 54 treesize of output 53 [2022-10-16 17:57:22,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:57:22,219 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 37 treesize of output 29 [2022-10-16 17:57:22,247 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 55 proven. 13 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-10-16 17:57:22,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:57:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-10-16 17:57:22,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666362401] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-16 17:57:22,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-16 17:57:22,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 8] total 17 [2022-10-16 17:57:22,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236498713] [2022-10-16 17:57:22,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:57:22,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:57:22,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:22,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:57:22,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-10-16 17:57:22,409 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:22,472 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-10-16 17:57:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 17:57:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-10-16 17:57:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:22,474 INFO L225 Difference]: With dead ends: 77 [2022-10-16 17:57:22,474 INFO L226 Difference]: Without dead ends: 76 [2022-10-16 17:57:22,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-10-16 17:57:22,476 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:22,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-10-16 17:57:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-16 17:57:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-10-16 17:57:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-10-16 17:57:22,486 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 68 [2022-10-16 17:57:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:22,487 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-10-16 17:57:22,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-10-16 17:57:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-10-16 17:57:22,488 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:22,489 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 10, 3, 3, 2, 2, 1, 1, 1] [2022-10-16 17:57:22,533 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:57:22,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:22,703 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:22,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2049595241, now seen corresponding path program 2 times [2022-10-16 17:57:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:22,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685287816] [2022-10-16 17:57:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-10-16 17:57:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:23,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685287816] [2022-10-16 17:57:23,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685287816] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:57:23,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912646196] [2022-10-16 17:57:23,896 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 17:57:23,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:23,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:57:23,897 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:57:23,918 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:57:24,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 17:57:24,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:57:24,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-16 17:57:24,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:57:24,096 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-10-16 17:57:24,097 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-10-16 17:57:24,108 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:57:24,119 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:57:24,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 20 [2022-10-16 17:57:24,165 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:57:24,185 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:57:24,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, 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:57:24,281 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:57:24,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 14 treesize of output 16 [2022-10-16 17:57:24,343 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:57:24,376 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:57:24,400 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:57:24,424 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:57:24,451 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:57:24,481 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:57:24,508 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:57:24,534 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:57:24,573 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 28 treesize of output 16 [2022-10-16 17:57:24,600 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:57:24,635 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 28 treesize of output 16 [2022-10-16 17:57:24,660 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:57:24,667 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:57:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-10-16 17:57:24,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:57:24,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:57:24,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 Int)) (or (not (<= v_ArrVal_503 (+ |c_ULTIMATE.start_main_#t~post9#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))) is different from false [2022-10-16 17:57:24,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_503) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)))) is different from false [2022-10-16 17:57:24,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_503))))) is different from false [2022-10-16 17:57:24,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_499)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (not (<= v_ArrVal_499 (+ |c_ULTIMATE.start_main_#t~post9#1| 1))) (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_503))))) is different from false [2022-10-16 17:57:24,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_499)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_503) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_499)))))) is different from false [2022-10-16 17:57:24,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 Int) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_503 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_498))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_499)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_501))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_499) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_503) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_503)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_504) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))))))) is different from false [2022-10-16 17:57:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 132 not checked. [2022-10-16 17:57:25,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912646196] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:57:25,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:57:25,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 20 [2022-10-16 17:57:25,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739422560] [2022-10-16 17:57:25,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:57:25,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-16 17:57:25,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:25,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-16 17:57:25,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=127, Unknown=7, NotChecked=210, Total=420 [2022-10-16 17:57:25,864 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:57:26,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:57:26,000 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-10-16 17:57:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 17:57:26,001 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-10-16 17:57:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:57:26,002 INFO L225 Difference]: With dead ends: 91 [2022-10-16 17:57:26,002 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 17:57:26,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 149 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=161, Unknown=7, NotChecked=238, Total=506 [2022-10-16 17:57:26,003 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 59 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:57:26,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 47 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 45 Invalid, 0 Unknown, 106 Unchecked, 0.0s Time] [2022-10-16 17:57:26,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 17:57:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-10-16 17:57:26,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:57:26,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-10-16 17:57:26,019 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 75 [2022-10-16 17:57:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:57:26,020 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-10-16 17:57:26,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.25) internal successors, (65), 21 states have internal predecessors, (65), 0 states have call successors, (0), 0 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:57:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-10-16 17:57:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-10-16 17:57:26,021 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:57:26,021 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 10, 4, 4, 3, 3, 1, 1, 1] [2022-10-16 17:57:26,065 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:57:26,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:26,227 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:57:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:57:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1096022061, now seen corresponding path program 3 times [2022-10-16 17:57:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:57:26,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94758156] [2022-10-16 17:57:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:57:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:57:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:57:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 195 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-10-16 17:57:27,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:57:27,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94758156] [2022-10-16 17:57:27,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94758156] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:57:27,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777809540] [2022-10-16 17:57:27,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 17:57:27,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:57:27,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:57:27,337 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:57:27,348 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:57:28,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-10-16 17:57:28,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:57:28,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 49 conjunts are in the unsatisfiable core [2022-10-16 17:57:28,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:57:28,150 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-10-16 17:57:28,151 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-10-16 17:57:28,158 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:57:28,165 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:57:28,209 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 49 treesize of output 20 [2022-10-16 17:57:28,212 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:57:28,295 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,295 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 14 treesize of output 20 [2022-10-16 17:57:28,300 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:57:28,363 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,364 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 18 treesize of output 24 [2022-10-16 17:57:28,417 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,418 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 18 treesize of output 24 [2022-10-16 17:57:28,471 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,471 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 18 treesize of output 24 [2022-10-16 17:57:28,526 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,526 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 18 treesize of output 24 [2022-10-16 17:57:28,579 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,579 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 18 treesize of output 24 [2022-10-16 17:57:28,634 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,635 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 18 treesize of output 24 [2022-10-16 17:57:28,699 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,700 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 18 treesize of output 24 [2022-10-16 17:57:28,748 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,748 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 18 treesize of output 24 [2022-10-16 17:57:28,798 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,798 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 18 treesize of output 24 [2022-10-16 17:57:28,848 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,849 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 18 treesize of output 24 [2022-10-16 17:57:28,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:57:28,971 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:28,971 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 18 treesize of output 24 [2022-10-16 17:57:29,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:57:29,093 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:57:29,093 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 18 treesize of output 24 [2022-10-16 17:57:29,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-10-16 17:57:29,308 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:57:29,309 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:57:29,367 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:57:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-10-16 17:57:29,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:57:33,839 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 134 refuted. 71 times theorem prover too weak. 265 trivial. 0 not checked. [2022-10-16 17:57:33,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777809540] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:57:33,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:57:33,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 15] total 36 [2022-10-16 17:57:33,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836454399] [2022-10-16 17:57:33,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:57:33,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-10-16 17:57:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:57:33,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-10-16 17:57:33,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=994, Unknown=68, NotChecked=0, Total=1332 [2022-10-16 17:57:33,848 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 37 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 37 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:57:36,854 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_#t~post9#1| 1)) (.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (<= .cse0 3) (<= (select .cse1 0) 20) (forall ((v_ArrVal_610 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_618 Int) (v_ArrVal_616 Int) (v_ArrVal_613 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_610)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_612))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_613)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_615))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_616)))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< (+ .cse2 1) v_ArrVal_618) (< 19 .cse2) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_616) (not (<= v_ArrVal_610 .cse4)) (< (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_613) (< (select (select (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_618)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)))))))))) (forall ((v_ArrVal_610 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_618 Int) (v_ArrVal_616 Int) (v_ArrVal_613 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_609))) (let ((.cse13 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse17 (store (store .cse18 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_610)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_612))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_613)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_615))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (store .cse16 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_616)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< (select (select (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_618)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ .cse12 1) v_ArrVal_618) (< (+ (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_610) (< (+ (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_613) (< 19 .cse12) (< (+ (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_616)))))))))))) (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_618 Int) (v_ArrVal_616 Int) (v_ArrVal_613 Int)) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_613)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_615))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse20 (store .cse23 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_616)))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< 19 .cse19) (not (<= v_ArrVal_613 .cse4)) (< (select (select (store .cse20 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_618)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse22 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_616) (< (+ .cse19 1) v_ArrVal_618)))))))) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_618 Int) (v_ArrVal_616 Int) (v_ArrVal_613 Int)) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_613)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_615))) (let ((.cse27 (select .cse28 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse25 (store .cse28 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_616)))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse24 (select .cse26 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< 19 .cse24) (< (select (select (store .cse25 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_618)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse27 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_616) (< (+ .cse24 1) v_ArrVal_618) (< (+ .cse0 1) v_ArrVal_613)))))))) (<= |c_ULTIMATE.start_main_#t~post9#1| 3)))) is different from false [2022-10-16 17:57:39,949 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse10 (select .cse17 |c_ULTIMATE.start_main_~c~0#1.offset|))) (and (forall ((v_ArrVal_610 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_609 (Array Int Int)) (v_ArrVal_618 Int) (v_ArrVal_616 Int) (v_ArrVal_613 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_609))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_610)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_612))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_613)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_615))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_616)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< (select (select (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_618)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ .cse2 1) v_ArrVal_618) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_610) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_613) (< 19 .cse2) (< (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_616)))))))))))) (forall ((v_ArrVal_610 Int) (v_ArrVal_612 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_618 Int) (v_ArrVal_616 Int) (v_ArrVal_613 Int)) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_610)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_612))) (let ((.cse12 (select .cse16 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse15 (store (store .cse16 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_613)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_615))) (let ((.cse11 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_616)))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< (+ .cse9 1) v_ArrVal_618) (< (+ .cse10 1) v_ArrVal_610) (< 19 .cse9) (< (+ (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_616) (< (+ (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_613) (< (select (select (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_618)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)))))))))) (< .cse10 2147483647)))) is different from false [2022-10-16 17:57:59,310 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|))) (let ((.cse3 (+ .cse5 1))) (and (forall ((v_ArrVal_618 Int) (v_ArrVal_616 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_616)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< (+ .cse0 1) v_ArrVal_618) (< 19 .cse0) (< (select (select (store .cse1 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_618)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< .cse3 v_ArrVal_616)))))) (< .cse5 2147483647) (forall ((v_ArrVal_615 (Array Int Int)) (v_ArrVal_618 Int) (v_ArrVal_616 Int) (v_ArrVal_613 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_613)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_615))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse7 (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_616)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< 19 .cse6) (< (select (select (store .cse7 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_618)) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_616) (< (+ .cse6 1) v_ArrVal_618) (< .cse3 v_ArrVal_613)))))))))))) is different from false [2022-10-16 17:58:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:58:23,631 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2022-10-16 17:58:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-10-16 17:58:23,631 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 37 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) Word has length 83 [2022-10-16 17:58:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:58:23,634 INFO L225 Difference]: With dead ends: 155 [2022-10-16 17:58:23,634 INFO L226 Difference]: Without dead ends: 154 [2022-10-16 17:58:23,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 163 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=1173, Invalid=3856, Unknown=385, NotChecked=438, Total=5852 [2022-10-16 17:58:23,638 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 194 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 568 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:58:23,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 108 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 568 Unchecked, 0.1s Time] [2022-10-16 17:58:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-10-16 17:58:23,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2022-10-16 17:58:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.1118881118881119) internal successors, (159), 143 states have internal predecessors, (159), 0 states have call successors, (0), 0 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:58:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2022-10-16 17:58:23,658 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 83 [2022-10-16 17:58:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:58:23,659 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2022-10-16 17:58:23,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.9166666666666665) internal successors, (105), 37 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:58:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2022-10-16 17:58:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-10-16 17:58:23,661 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:58:23,661 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 12, 4, 4, 3, 3, 1, 1, 1] [2022-10-16 17:58:23,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-10-16 17:58:23,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:58:23,862 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:58:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:58:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash -316549779, now seen corresponding path program 4 times [2022-10-16 17:58:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:58:23,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661483974] [2022-10-16 17:58:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:58:23,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:58:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:58:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 512 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 17:58:28,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:58:28,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661483974] [2022-10-16 17:58:28,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661483974] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:58:28,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482606183] [2022-10-16 17:58:28,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 17:58:28,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:58:28,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:58:28,220 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:58:28,224 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:58:28,344 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 17:58:28,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:58:28,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 17:58:28,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:58:28,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 10 treesize of output 8 [2022-10-16 17:58:28,653 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:58:28,726 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:58:28,844 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:58:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 159 proven. 68 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2022-10-16 17:58:28,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:58:29,070 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_721 (Array Int Int))) (< 9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|))) is different from false [2022-10-16 17:58:29,085 WARN L833 $PredicateComparison]: unable to prove that (or (<= |c_ULTIMATE.start_main_#t~mem7#1| 10) (forall ((v_ArrVal_721 (Array Int Int))) (< 9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)))) is different from false [2022-10-16 17:58:29,099 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 17:58:29,100 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 18 treesize of output 19 [2022-10-16 17:58:29,105 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 29 treesize of output 21 [2022-10-16 17:58:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 143 proven. 67 refuted. 0 times theorem prover too weak. 388 trivial. 17 not checked. [2022-10-16 17:58:29,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482606183] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 17:58:29,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 17:58:29,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 8, 8] total 54 [2022-10-16 17:58:29,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192679373] [2022-10-16 17:58:29,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 17:58:29,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-10-16 17:58:29,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:58:29,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-10-16 17:58:29,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=2167, Unknown=2, NotChecked=202, Total=2862 [2022-10-16 17:58:29,302 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 54 states, 54 states have (on average 2.2777777777777777) internal successors, (123), 54 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:58:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:58:31,314 INFO L93 Difference]: Finished difference Result 207 states and 230 transitions. [2022-10-16 17:58:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-10-16 17:58:31,314 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.2777777777777777) internal successors, (123), 54 states have internal predecessors, (123), 0 states have call successors, (0), 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 93 [2022-10-16 17:58:31,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:58:31,316 INFO L225 Difference]: With dead ends: 207 [2022-10-16 17:58:31,316 INFO L226 Difference]: Without dead ends: 116 [2022-10-16 17:58:31,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 179 SyntacticMatches, 15 SemanticMatches, 71 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2106 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=989, Invalid=3987, Unknown=2, NotChecked=278, Total=5256 [2022-10-16 17:58:31,320 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:58:31,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 132 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1035 Invalid, 0 Unknown, 58 Unchecked, 1.1s Time] [2022-10-16 17:58:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-16 17:58:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-10-16 17:58:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.008695652173913) internal successors, (116), 115 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:58:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2022-10-16 17:58:31,361 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 93 [2022-10-16 17:58:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:58:31,362 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2022-10-16 17:58:31,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.2777777777777777) internal successors, (123), 54 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:58:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2022-10-16 17:58:31,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-10-16 17:58:31,366 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:58:31,366 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 10, 8, 8, 7, 7, 1, 1, 1] [2022-10-16 17:58:31,411 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:58:31,584 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,SelfDestructingSolverStorable11 [2022-10-16 17:58:31,585 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 17:58:31,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:58:31,586 INFO L85 PathProgramCache]: Analyzing trace with hash -600991099, now seen corresponding path program 5 times [2022-10-16 17:58:31,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:58:31,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920220194] [2022-10-16 17:58:31,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:58:31,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:58:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:58:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 0 proven. 567 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-10-16 17:58:34,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:58:34,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920220194] [2022-10-16 17:58:34,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920220194] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:58:34,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463161052] [2022-10-16 17:58:34,024 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 17:58:34,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:58:34,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:58:34,027 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:58:34,051 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:58:34,631 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-10-16 17:58:34,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 17:58:34,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 103 conjunts are in the unsatisfiable core [2022-10-16 17:58:34,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:58:34,700 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-10-16 17:58:34,700 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-10-16 17:58:34,709 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:58:34,718 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:58:34,737 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 42 treesize of output 15 [2022-10-16 17:58:34,742 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:58:34,952 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:58:34,953 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 34 [2022-10-16 17:58:34,966 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:58:34,973 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 19 treesize of output 15 [2022-10-16 17:58:35,089 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:58:35,090 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 18 treesize of output 24 [2022-10-16 17:58:35,177 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:58:35,178 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 18 treesize of output 24 [2022-10-16 17:58:35,273 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:58:35,273 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 18 treesize of output 24 [2022-10-16 17:58:35,373 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:58:35,374 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 18 treesize of output 24 [2022-10-16 17:58:35,453 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:58:35,454 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 18 treesize of output 24 [2022-10-16 17:58:35,528 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:58:35,529 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 18 treesize of output 24 [2022-10-16 17:58:35,605 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:58:35,606 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 18 treesize of output 24 [2022-10-16 17:58:35,697 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:58:35,697 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 18 treesize of output 24 [2022-10-16 17:58:35,793 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 17:58:35,793 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 18 treesize of output 24 [2022-10-16 17:58:35,896 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-10-16 17:58:35,896 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 23 treesize of output 26 [2022-10-16 17:58:36,087 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:58:36,088 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 36 treesize of output 39 [2022-10-16 17:58:36,429 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:58:36,429 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 52 treesize of output 51 [2022-10-16 17:58:36,737 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:58:36,737 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 45 treesize of output 44 [2022-10-16 17:58:37,033 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:58:37,034 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 48 treesize of output 47 [2022-10-16 17:58:37,419 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:58:37,420 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 45 treesize of output 44 [2022-10-16 17:58:37,782 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:58:37,783 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 48 treesize of output 47 [2022-10-16 17:58:38,078 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:58:38,078 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 45 treesize of output 44 [2022-10-16 17:58:38,421 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-10-16 17:58:38,422 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 48 treesize of output 47 [2022-10-16 17:58:38,741 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-10-16 17:58:38,742 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 45 treesize of output 44 [2022-10-16 17:58:39,139 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 17:58:39,139 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 28 treesize of output 30 [2022-10-16 17:58:39,309 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 28 treesize of output 16 [2022-10-16 17:58:39,424 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:58:39,536 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 28 treesize of output 16 [2022-10-16 17:58:39,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:58:39,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 15 treesize of output 7 [2022-10-16 17:58:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 10 proven. 607 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-10-16 17:58:39,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 17:58:39,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)) is different from false [2022-10-16 17:58:39,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int))) (or (not (<= v_ArrVal_885 (+ |c_ULTIMATE.start_main_#t~post9#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))) is different from false [2022-10-16 17:58:39,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)))) is different from false [2022-10-16 17:58:39,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647))))) is different from false [2022-10-16 17:58:39,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_881 (+ |c_ULTIMATE.start_main_#t~post9#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885))))) is different from false [2022-10-16 17:58:40,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 Int) (v_ArrVal_883 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885)))))) is different from false [2022-10-16 17:58:40,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881))))))) is different from false [2022-10-16 17:58:40,089 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881))))))) (not (< |c_ULTIMATE.start_main_#t~mem4#1| 20))) is different from false [2022-10-16 17:58:40,632 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 19 (select (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) v_ArrVal_877)) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885)))))))) is different from false [2022-10-16 17:58:40,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 19 (select (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< v_ArrVal_877 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885))))))))) is different from false [2022-10-16 17:58:40,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| (+ |c_ULTIMATE.start_main_#t~post9#1| 1))))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< 19 (select (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< v_ArrVal_877 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))))))))))) is different from false [2022-10-16 17:58:40,968 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)))))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse3 (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< 19 (select (select .cse3 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< v_ArrVal_877 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))))))))))) is different from false [2022-10-16 17:58:41,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse8 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse4 (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (store .cse4 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< v_ArrVal_877 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 19 (select (select .cse4 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) v_ArrVal_872)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885)))))))))) is different from false [2022-10-16 17:58:41,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse2 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< v_ArrVal_877 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< v_ArrVal_872 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< 19 (select (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885))))))))))) is different from false [2022-10-16 17:58:41,549 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| (+ |c_ULTIMATE.start_main_#t~post9#1| 1))))) (let ((.cse2 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse4 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< v_ArrVal_877 (+ 1 (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|))) (< v_ArrVal_872 (+ (select .cse2 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 19 (select (select .cse5 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|))))))))))))) is different from false [2022-10-16 17:58:43,277 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_869 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_869)))) (store .cse13 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse4 (select .cse12 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse9 (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse11 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 19 (select (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) v_ArrVal_869)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< v_ArrVal_872 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_877 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))))))))))))) is different from false [2022-10-16 17:58:43,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_869 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_869)))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse4 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (let ((.cse11 (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 19 (select (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< (+ (select .cse3 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< v_ArrVal_872 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_869 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_877 (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)))))))))))))) is different from false [2022-10-16 17:58:44,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_869 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| (+ |c_ULTIMATE.start_main_#t~post9#1| 1))))) (let ((.cse5 (select .cse16 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_869)))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse3 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (let ((.cse11 (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse7 (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< 19 (select (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< v_ArrVal_872 (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_877 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_869 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (select (select (store (store .cse6 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647)))))))))))))) is different from false [2022-10-16 17:58:44,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_869 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse17 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)))))) (let ((.cse5 (select .cse16 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_869)))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse3 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (let ((.cse11 (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 19 (select (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< v_ArrVal_872 (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_877 (+ (select .cse4 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< v_ArrVal_869 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse6 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881)))))))))))))) is different from false [2022-10-16 17:58:44,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_869 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int) (v_ArrVal_865 Int)) (let ((.cse16 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_865)))) (store .cse17 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (select .cse16 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse13 (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_869)))) (store .cse14 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse1 (select .cse13 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse10 (let ((.cse11 (store .cse13 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse11 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (select .cse10 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse7 (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse3 (store (store .cse7 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< 19 (select (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) v_ArrVal_865)) (< v_ArrVal_872 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< v_ArrVal_877 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_869 (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1))))))))))))))) is different from false [2022-10-16 17:58:45,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_869 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int) (v_ArrVal_865 Int)) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse17 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_865)))) (store .cse18 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse19 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (select .cse17 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse14 (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_869)))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse1 (select .cse14 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse11 (let ((.cse12 (store .cse14 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse0 (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse8 (store .cse0 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse3 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< 19 (select (select .cse0 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< v_ArrVal_872 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< v_ArrVal_877 (+ (select .cse5 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_869 (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_865 (+ (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)))))))))))))))) is different from false [2022-10-16 17:58:46,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_869 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int) (v_ArrVal_865 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| (+ |c_ULTIMATE.start_main_#t~post9#1| 1))))) (let ((.cse1 (select .cse20 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse17 (let ((.cse18 (store .cse20 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_865)))) (store .cse18 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse19 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse0 (select .cse17 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse14 (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_869)))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse6 (select .cse14 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse11 (let ((.cse12 (store .cse14 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse3 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse2 (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse4 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< v_ArrVal_869 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_865 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< 19 (select (select .cse2 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< v_ArrVal_877 (+ (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (select (select (store (store .cse4 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< v_ArrVal_872 (+ (select .cse6 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse7 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881)))))))))))))))) is different from false [2022-10-16 17:58:47,078 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_885 Int) (v_ArrVal_886 (Array Int Int)) (v_ArrVal_872 Int) (v_ArrVal_881 Int) (v_ArrVal_869 Int) (v_ArrVal_880 (Array Int Int)) (v_ArrVal_883 (Array Int Int)) (v_ArrVal_877 Int) (v_ArrVal_865 Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse21 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse21 |c_ULTIMATE.start_main_~c~0#1.offset|) 1)))))) (let ((.cse1 (select .cse20 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse17 (let ((.cse18 (store .cse20 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_865)))) (store .cse18 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse19 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse19 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse3 (select .cse17 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse14 (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_869)))) (store .cse15 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse16 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse0 (select .cse14 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse11 (let ((.cse12 (store .cse14 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_872)))) (store .cse12 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse7 (select .cse11 |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse6 (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~i~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~i~0#1.offset| v_ArrVal_877)))) (store .cse9 |c_ULTIMATE.start_main_~c~0#1.base| (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse10 |c_ULTIMATE.start_main_~c~0#1.offset| (+ (select .cse10 |c_ULTIMATE.start_main_~c~0#1.offset|) 1))))))) (let ((.cse8 (store .cse6 |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_880))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse5 (store (store .cse8 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_881)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_883))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~c~0#1.base|))) (or (< v_ArrVal_872 (+ (select .cse0 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< v_ArrVal_865 (+ (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) 1)) (< (+ (select .cse2 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_885) (< v_ArrVal_869 (+ 1 (select .cse3 |c_ULTIMATE.start_main_~i~0#1.offset|))) (< (+ (select .cse4 |c_ULTIMATE.start_main_~c~0#1.offset|) 1) v_ArrVal_881) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| v_ArrVal_885)) |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 2147483647) (< 19 (select (select .cse6 |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) (< v_ArrVal_877 (+ 1 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|)))))))))))))))))) (<= |c_ULTIMATE.start_main_#t~mem7#1| 10)) is different from false