/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/array-fpi/ms1f.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:39:06,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:39:06,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:39:06,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:39:06,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:39:06,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:39:06,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:39:06,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:39:06,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:39:06,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:39:06,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:39:07,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:39:07,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:39:07,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:39:07,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:39:07,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:39:07,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:39:07,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:39:07,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:39:07,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:39:07,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:39:07,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:39:07,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:39:07,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:39:07,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:39:07,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:39:07,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:39:07,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:39:07,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:39:07,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:39:07,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:39:07,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:39:07,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:39:07,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:39:07,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:39:07,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:39:07,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:39:07,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:39:07,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:39:07,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:39:07,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:39:07,067 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 10:39:07,125 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:39:07,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:39:07,126 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:39:07,126 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:39:07,128 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:39:07,128 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:39:07,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:39:07,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:39:07,132 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:39:07,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:39:07,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:39:07,134 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:39:07,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:39:07,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:39:07,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:39:07,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:39:07,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:39:07,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:39:07,135 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:39:07,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:39:07,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:39:07,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:39:07,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:39:07,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:39:07,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:39:07,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:39:07,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:39:07,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:39:07,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:39:07,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:39:07,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:39:07,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:39:07,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:39:07,138 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 10:39:07,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:39:07,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:39:07,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:39:07,581 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:39:07,582 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:39:07,584 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ms1f.c [2022-10-16 10:39:07,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de458cb55/324306b89bf445c48cada7f4bc392dc1/FLAG91300957e [2022-10-16 10:39:08,248 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:39:08,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms1f.c [2022-10-16 10:39:08,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de458cb55/324306b89bf445c48cada7f4bc392dc1/FLAG91300957e [2022-10-16 10:39:08,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de458cb55/324306b89bf445c48cada7f4bc392dc1 [2022-10-16 10:39:08,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:39:08,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:39:08,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:39:08,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:39:08,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:39:08,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:39:08" (1/1) ... [2022-10-16 10:39:08,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c58d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:08, skipping insertion in model container [2022-10-16 10:39:08,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:39:08" (1/1) ... [2022-10-16 10:39:08,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:39:08,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:39:08,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms1f.c[587,600] [2022-10-16 10:39:08,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:39:08,966 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:39:08,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms1f.c[587,600] [2022-10-16 10:39:08,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:39:09,002 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:39:09,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09 WrapperNode [2022-10-16 10:39:09,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:39:09,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:39:09,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:39:09,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:39:09,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,044 INFO L138 Inliner]: procedures = 17, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2022-10-16 10:39:09,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:39:09,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:39:09,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:39:09,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:39:09,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,073 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:39:09,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:39:09,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:39:09,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:39:09,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (1/1) ... [2022-10-16 10:39:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:39:09,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:09,120 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 10:39:09,125 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 10:39:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:39:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:39:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:39:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:39:09,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:39:09,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:39:09,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:39:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:39:09,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:39:09,305 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:39:09,307 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:39:09,593 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:39:09,601 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:39:09,601 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-16 10:39:09,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:39:09 BoogieIcfgContainer [2022-10-16 10:39:09,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:39:09,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:39:09,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:39:09,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:39:09,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:39:08" (1/3) ... [2022-10-16 10:39:09,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73741605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:39:09, skipping insertion in model container [2022-10-16 10:39:09,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:39:09" (2/3) ... [2022-10-16 10:39:09,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73741605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:39:09, skipping insertion in model container [2022-10-16 10:39:09,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:39:09" (3/3) ... [2022-10-16 10:39:09,616 INFO L112 eAbstractionObserver]: Analyzing ICFG ms1f.c [2022-10-16 10:39:09,641 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:39:09,641 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-10-16 10:39:09,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:39:09,813 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;@c8285f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:39:09,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-16 10:39:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 23 states have (on average 1.608695652173913) internal successors, (37), 29 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 10:39:09,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:39:09,830 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:09,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:09,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:09,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:09,838 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:39:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:09,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565838488] [2022-10-16 10:39:09,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:09,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:10,050 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 10:39:10,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:10,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565838488] [2022-10-16 10:39:10,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565838488] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:39:10,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:39:10,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:39:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117311559] [2022-10-16 10:39:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:39:10,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:39:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:39:10,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:39:10,100 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.608695652173913) internal successors, (37), 29 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 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 10:39:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:10,120 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-10-16 10:39:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:39:10,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-16 10:39:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:10,133 INFO L225 Difference]: With dead ends: 56 [2022-10-16 10:39:10,133 INFO L226 Difference]: Without dead ends: 23 [2022-10-16 10:39:10,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:39:10,142 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:10,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:39:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-10-16 10:39:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-10-16 10:39:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-10-16 10:39:10,186 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 8 [2022-10-16 10:39:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:10,186 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-10-16 10:39:10,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 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 10:39:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-10-16 10:39:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:39:10,187 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:10,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:10,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:39:10,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:39:10,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:10,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748952822] [2022-10-16 10:39:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:10,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:10,400 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 10:39:10,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:10,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748952822] [2022-10-16 10:39:10,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748952822] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:39:10,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:39:10,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:39:10,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736511565] [2022-10-16 10:39:10,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:39:10,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:39:10,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:10,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:39:10,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:39:10,405 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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 10:39:10,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:10,475 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-10-16 10:39:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:39:10,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-16 10:39:10,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:10,477 INFO L225 Difference]: With dead ends: 48 [2022-10-16 10:39:10,477 INFO L226 Difference]: Without dead ends: 35 [2022-10-16 10:39:10,478 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 10:39:10,480 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:10,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 44 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:39:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-16 10:39:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-10-16 10:39:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.391304347826087) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 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 10:39:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-10-16 10:39:10,488 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 8 [2022-10-16 10:39:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:10,489 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-10-16 10:39:10,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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 10:39:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-10-16 10:39:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 10:39:10,490 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:10,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:10,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:39:10,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -448816170, now seen corresponding path program 1 times [2022-10-16 10:39:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:10,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342438767] [2022-10-16 10:39:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:10,637 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 10:39:10,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:10,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342438767] [2022-10-16 10:39:10,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342438767] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:39:10,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:39:10,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:39:10,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997010950] [2022-10-16 10:39:10,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:39:10,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:39:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:10,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:39:10,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:39:10,642 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:10,718 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-10-16 10:39:10,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:39:10,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-16 10:39:10,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:10,720 INFO L225 Difference]: With dead ends: 48 [2022-10-16 10:39:10,720 INFO L226 Difference]: Without dead ends: 34 [2022-10-16 10:39:10,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:39:10,726 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:10,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:39:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-16 10:39:10,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-10-16 10:39:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 28 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 10:39:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-10-16 10:39:10,740 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 11 [2022-10-16 10:39:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:10,740 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-10-16 10:39:10,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-10-16 10:39:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:39:10,742 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:10,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:10,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:39:10,744 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:10,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:39:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:10,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560852012] [2022-10-16 10:39:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:10,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:10,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560852012] [2022-10-16 10:39:10,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560852012] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:10,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82653579] [2022-10-16 10:39:10,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:10,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:10,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:10,940 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 10:39:10,965 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 10:39:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:11,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:39:11,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:11,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:39:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:11,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82653579] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:39:11,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:39:11,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:39:11,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097247350] [2022-10-16 10:39:11,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:39:11,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:39:11,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:11,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:39:11,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:39:11,196 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:11,399 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-10-16 10:39:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:39:11,400 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 10:39:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:11,407 INFO L225 Difference]: With dead ends: 53 [2022-10-16 10:39:11,407 INFO L226 Difference]: Without dead ends: 52 [2022-10-16 10:39:11,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:39:11,412 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:11,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 67 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:39:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-16 10:39:11,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-10-16 10:39:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-10-16 10:39:11,431 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 12 [2022-10-16 10:39:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:11,431 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-10-16 10:39:11,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-10-16 10:39:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:39:11,432 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:11,436 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:11,490 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 10:39:11,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:11,638 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:11,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:11,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:39:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:11,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610899283] [2022-10-16 10:39:11,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:11,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:11,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610899283] [2022-10-16 10:39:11,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610899283] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:11,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302350429] [2022-10-16 10:39:11,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:11,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:11,796 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 10:39:11,819 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 10:39:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:11,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:39:11,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:11,944 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 10:39:11,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:39:11,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302350429] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:39:11,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:39:11,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:39:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507809117] [2022-10-16 10:39:11,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:39:11,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:39:11,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:11,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:39:11,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:39:11,950 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:12,026 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-10-16 10:39:12,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:39:12,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 10:39:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:12,031 INFO L225 Difference]: With dead ends: 45 [2022-10-16 10:39:12,032 INFO L226 Difference]: Without dead ends: 44 [2022-10-16 10:39:12,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:39:12,034 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:12,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 56 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:39:12,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-16 10:39:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-10-16 10:39:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 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 10:39:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-10-16 10:39:12,049 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2022-10-16 10:39:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:12,049 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-10-16 10:39:12,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-10-16 10:39:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 10:39:12,054 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:12,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:12,092 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 10:39:12,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:12,269 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash 175506266, now seen corresponding path program 1 times [2022-10-16 10:39:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:12,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060589274] [2022-10-16 10:39:12,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:12,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:39:12,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:12,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060589274] [2022-10-16 10:39:12,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060589274] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:39:12,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:39:12,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:39:12,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012433170] [2022-10-16 10:39:12,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:39:12,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:39:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:12,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:39:12,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:39:12,415 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:12,463 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-10-16 10:39:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:39:12,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 10:39:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:12,472 INFO L225 Difference]: With dead ends: 44 [2022-10-16 10:39:12,473 INFO L226 Difference]: Without dead ends: 42 [2022-10-16 10:39:12,473 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 10:39:12,479 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:12,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:39:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-16 10:39:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-10-16 10:39:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-10-16 10:39:12,491 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 15 [2022-10-16 10:39:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:12,492 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-10-16 10:39:12,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-10-16 10:39:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 10:39:12,493 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:12,493 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:12,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 10:39:12,494 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash 249068045, now seen corresponding path program 1 times [2022-10-16 10:39:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:12,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289358574] [2022-10-16 10:39:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:12,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:12,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289358574] [2022-10-16 10:39:12,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289358574] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:12,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703320820] [2022-10-16 10:39:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:12,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:12,648 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 10:39:12,656 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 10:39:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:12,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:39:12,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:12,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:39:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:12,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703320820] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:39:12,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:39:12,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:39:12,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128585251] [2022-10-16 10:39:12,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:39:12,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:39:12,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:12,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:39:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:39:12,911 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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 10:39:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:13,093 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-10-16 10:39:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 10:39:13,093 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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 19 [2022-10-16 10:39:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:13,096 INFO L225 Difference]: With dead ends: 63 [2022-10-16 10:39:13,097 INFO L226 Difference]: Without dead ends: 42 [2022-10-16 10:39:13,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-10-16 10:39:13,103 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:13,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 77 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:39:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-16 10:39:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-10-16 10:39:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-10-16 10:39:13,118 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2022-10-16 10:39:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:13,123 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-10-16 10:39:13,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 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 10:39:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-10-16 10:39:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:39:13,124 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:13,125 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:13,161 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 10:39:13,325 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 10:39:13,326 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:13,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1711202927, now seen corresponding path program 2 times [2022-10-16 10:39:13,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:13,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872173471] [2022-10-16 10:39:13,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:13,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:14,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:14,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872173471] [2022-10-16 10:39:14,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872173471] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:14,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741069674] [2022-10-16 10:39:14,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:39:14,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:14,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:14,152 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 10:39:14,176 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 10:39:14,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:39:14,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:39:14,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 29 conjunts are in the unsatisfiable core [2022-10-16 10:39:14,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:14,280 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 10:39:14,368 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 21 treesize of output 17 [2022-10-16 10:39:14,499 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 31 treesize of output 30 [2022-10-16 10:39:14,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:39:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:14,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:39:23,269 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 174 treesize of output 162 [2022-10-16 10:39:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:24,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741069674] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:39:24,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:39:24,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-10-16 10:39:24,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996671832] [2022-10-16 10:39:24,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:39:24,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-16 10:39:24,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:24,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-16 10:39:24,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=597, Unknown=4, NotChecked=0, Total=702 [2022-10-16 10:39:24,822 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:25,231 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-10-16 10:39:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:39:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 10:39:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:25,233 INFO L225 Difference]: With dead ends: 65 [2022-10-16 10:39:25,233 INFO L226 Difference]: Without dead ends: 51 [2022-10-16 10:39:25,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=170, Invalid=882, Unknown=4, NotChecked=0, Total=1056 [2022-10-16 10:39:25,235 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 62 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:25,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 162 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 289 Invalid, 0 Unknown, 34 Unchecked, 0.2s Time] [2022-10-16 10:39:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-16 10:39:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2022-10-16 10:39:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 10:39:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-10-16 10:39:25,243 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 23 [2022-10-16 10:39:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:25,243 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-10-16 10:39:25,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-10-16 10:39:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:39:25,244 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:25,244 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:25,279 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 10:39:25,445 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 10:39:25,446 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:25,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:25,447 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:39:25,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:25,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137121730] [2022-10-16 10:39:25,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:25,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:25,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137121730] [2022-10-16 10:39:25,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137121730] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:25,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990416693] [2022-10-16 10:39:25,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:39:25,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:25,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:25,657 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 10:39:25,681 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 10:39:25,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:39:25,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:39:25,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:39:25,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:39:25,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:39:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:39:25,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990416693] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:39:25,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:39:25,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:39:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165712972] [2022-10-16 10:39:25,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:39:25,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:39:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:25,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:39:25,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:39:25,835 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:26,043 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-10-16 10:39:26,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:39:26,044 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 10:39:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:26,045 INFO L225 Difference]: With dead ends: 56 [2022-10-16 10:39:26,045 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 10:39:26,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:39:26,046 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:26,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:39:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 10:39:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2022-10-16 10:39:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 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 10:39:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-10-16 10:39:26,053 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 24 [2022-10-16 10:39:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:26,054 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-10-16 10:39:26,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-10-16 10:39:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:39:26,055 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:26,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:26,096 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 10:39:26,268 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 10:39:26,269 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1479483520, now seen corresponding path program 1 times [2022-10-16 10:39:26,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:26,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913225635] [2022-10-16 10:39:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:26,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:39:26,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:26,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913225635] [2022-10-16 10:39:26,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913225635] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:26,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505227161] [2022-10-16 10:39:26,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:26,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:26,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:26,370 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 10:39:26,390 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 10:39:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:26,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:39:26,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:39:26,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:39:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:39:26,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505227161] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:39:26,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:39:26,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:39:26,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968133799] [2022-10-16 10:39:26,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:39:26,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:39:26,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:26,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:39:26,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:39:26,527 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:26,646 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2022-10-16 10:39:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:39:26,647 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-16 10:39:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:26,647 INFO L225 Difference]: With dead ends: 60 [2022-10-16 10:39:26,648 INFO L226 Difference]: Without dead ends: 59 [2022-10-16 10:39:26,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:39:26,649 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:26,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 58 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:39:26,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-16 10:39:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2022-10-16 10:39:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.297872340425532) internal successors, (61), 50 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-10-16 10:39:26,657 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 26 [2022-10-16 10:39:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:26,657 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-10-16 10:39:26,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-10-16 10:39:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-16 10:39:26,658 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:26,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:26,705 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 10:39:26,872 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 10:39:26,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1380651221, now seen corresponding path program 1 times [2022-10-16 10:39:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:26,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459691000] [2022-10-16 10:39:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:39:26,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:26,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459691000] [2022-10-16 10:39:26,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459691000] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:26,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445728095] [2022-10-16 10:39:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:26,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:26,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:26,951 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 10:39:26,969 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 10:39:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:27,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:39:27,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:39:27,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:39:27,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445728095] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:39:27,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:39:27,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:39:27,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540373069] [2022-10-16 10:39:27,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:39:27,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:39:27,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:39:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:39:27,048 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:27,097 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2022-10-16 10:39:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:39:27,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-10-16 10:39:27,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:27,098 INFO L225 Difference]: With dead ends: 84 [2022-10-16 10:39:27,099 INFO L226 Difference]: Without dead ends: 50 [2022-10-16 10:39:27,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:39:27,100 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:27,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 42 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:39:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-16 10:39:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-16 10:39:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-10-16 10:39:27,107 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 27 [2022-10-16 10:39:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:27,107 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-10-16 10:39:27,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-10-16 10:39:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 10:39:27,108 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:27,109 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:27,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 10:39:27,321 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 10:39:27,322 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:27,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1921199309, now seen corresponding path program 1 times [2022-10-16 10:39:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:27,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183215601] [2022-10-16 10:39:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:27,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:27,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183215601] [2022-10-16 10:39:27,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183215601] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:27,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041642502] [2022-10-16 10:39:27,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:27,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:27,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:27,507 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 10:39:27,511 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 10:39:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:27,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:39:27,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:27,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:39:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:27,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041642502] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:39:27,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:39:27,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:39:27,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800047439] [2022-10-16 10:39:27,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:39:27,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:39:27,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:39:27,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:39:27,833 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:28,032 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-10-16 10:39:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:39:28,033 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-16 10:39:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:28,033 INFO L225 Difference]: With dead ends: 93 [2022-10-16 10:39:28,034 INFO L226 Difference]: Without dead ends: 57 [2022-10-16 10:39:28,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:39:28,035 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:28,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 96 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:39:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-16 10:39:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2022-10-16 10:39:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-10-16 10:39:28,044 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 30 [2022-10-16 10:39:28,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:28,044 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-10-16 10:39:28,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-10-16 10:39:28,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:39:28,046 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:28,046 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:28,085 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 10:39:28,256 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 10:39:28,257 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:28,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash 221877551, now seen corresponding path program 2 times [2022-10-16 10:39:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:28,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920893958] [2022-10-16 10:39:28,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:28,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:28,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:28,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920893958] [2022-10-16 10:39:28,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920893958] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:28,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329734279] [2022-10-16 10:39:28,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:39:28,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:28,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:28,919 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 10:39:28,941 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 10:39:29,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:39:29,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:39:29,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 10:39:29,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:29,157 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 13 treesize of output 9 [2022-10-16 10:39:29,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:29,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:39:29,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:29,405 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 23 treesize of output 22 [2022-10-16 10:39:29,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:29,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:39:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:29,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:39:30,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:30,886 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-10-16 10:39:30,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) is different from false [2022-10-16 10:39:30,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) is different from false [2022-10-16 10:39:30,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:30,999 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 28 treesize of output 29 [2022-10-16 10:39:31,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:31,013 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 86 treesize of output 74 [2022-10-16 10:39:31,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:31,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-10-16 10:39:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-10-16 10:39:31,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329734279] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:39:31,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:39:31,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 40 [2022-10-16 10:39:31,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597627027] [2022-10-16 10:39:31,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:39:31,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-16 10:39:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:31,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-16 10:39:31,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1355, Unknown=2, NotChecked=150, Total=1640 [2022-10-16 10:39:31,101 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 41 states, 40 states have (on average 2.125) internal successors, (85), 41 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:31,971 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-10-16 10:39:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:39:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 41 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-10-16 10:39:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:31,972 INFO L225 Difference]: With dead ends: 59 [2022-10-16 10:39:31,972 INFO L226 Difference]: Without dead ends: 58 [2022-10-16 10:39:31,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=274, Invalid=2384, Unknown=2, NotChecked=202, Total=2862 [2022-10-16 10:39:31,975 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 102 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:31,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 183 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 514 Invalid, 0 Unknown, 246 Unchecked, 0.3s Time] [2022-10-16 10:39:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-16 10:39:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2022-10-16 10:39:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 10:39:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-10-16 10:39:31,982 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 34 [2022-10-16 10:39:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:31,982 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-10-16 10:39:31,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.125) internal successors, (85), 41 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-10-16 10:39:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-16 10:39:31,983 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:31,983 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:32,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 10:39:32,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-16 10:39:32,199 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:32,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1711730432, now seen corresponding path program 1 times [2022-10-16 10:39:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:32,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077768666] [2022-10-16 10:39:32,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:32,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077768666] [2022-10-16 10:39:32,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077768666] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:32,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337518904] [2022-10-16 10:39:32,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:32,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:32,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:32,864 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:39:32,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 10:39:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:32,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 10:39:32,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:33,067 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 13 treesize of output 9 [2022-10-16 10:39:33,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:33,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:39:33,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:33,293 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 23 treesize of output 22 [2022-10-16 10:39:33,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:33,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:39:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:33,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:39:42,424 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:42,425 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-10-16 10:39:42,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:39:42,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ 2147483648 .cse0) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0))))) is different from false [2022-10-16 10:39:42,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:42,506 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 29 treesize of output 30 [2022-10-16 10:39:42,516 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:42,517 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 88 treesize of output 76 [2022-10-16 10:39:42,526 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:42,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-10-16 10:39:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-10-16 10:39:42,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337518904] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:39:42,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:39:42,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 37 [2022-10-16 10:39:42,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177568973] [2022-10-16 10:39:42,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:39:42,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-16 10:39:42,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:42,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-16 10:39:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1143, Unknown=9, NotChecked=138, Total=1406 [2022-10-16 10:39:42,603 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 38 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 10:39:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:43,572 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2022-10-16 10:39:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-16 10:39:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 38 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) Word has length 35 [2022-10-16 10:39:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:43,573 INFO L225 Difference]: With dead ends: 79 [2022-10-16 10:39:43,573 INFO L226 Difference]: Without dead ends: 78 [2022-10-16 10:39:43,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=272, Invalid=2277, Unknown=9, NotChecked=198, Total=2756 [2022-10-16 10:39:43,576 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 103 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:43,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 191 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 492 Invalid, 0 Unknown, 236 Unchecked, 0.3s Time] [2022-10-16 10:39:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-16 10:39:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2022-10-16 10:39:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-10-16 10:39:43,583 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 35 [2022-10-16 10:39:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:43,583 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-10-16 10:39:43,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 38 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 10:39:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-10-16 10:39:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:39:43,584 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:43,584 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:43,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 10:39:43,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-16 10:39:43,799 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:43,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1411001813, now seen corresponding path program 3 times [2022-10-16 10:39:43,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:43,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225081425] [2022-10-16 10:39:43,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:43,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:44,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:44,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225081425] [2022-10-16 10:39:44,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225081425] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:44,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071580195] [2022-10-16 10:39:44,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:39:44,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:44,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:44,108 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:39:44,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 10:39:44,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-16 10:39:44,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:39:44,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:39:44,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:44,397 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:44,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:39:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:44,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071580195] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:39:44,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:39:44,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2022-10-16 10:39:44,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40615985] [2022-10-16 10:39:44,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:39:44,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 10:39:44,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:44,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 10:39:44,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:39:44,571 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:44,812 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-10-16 10:39:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 10:39:44,812 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:39:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:44,813 INFO L225 Difference]: With dead ends: 97 [2022-10-16 10:39:44,813 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 10:39:44,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2022-10-16 10:39:44,815 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:44,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 115 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:39:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 10:39:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2022-10-16 10:39:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-10-16 10:39:44,821 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 41 [2022-10-16 10:39:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:44,822 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-10-16 10:39:44,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.607142857142857) internal successors, (73), 28 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-10-16 10:39:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 10:39:44,823 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:44,823 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:44,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-16 10:39:45,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 10:39:45,039 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1734973017, now seen corresponding path program 4 times [2022-10-16 10:39:45,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:45,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481883274] [2022-10-16 10:39:45,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:45,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:46,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:46,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481883274] [2022-10-16 10:39:46,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481883274] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:46,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013165817] [2022-10-16 10:39:46,124 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:39:46,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:46,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:46,126 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:39:46,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 10:39:46,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:39:46,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:39:46,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 42 conjunts are in the unsatisfiable core [2022-10-16 10:39:46,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:46,445 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 13 treesize of output 9 [2022-10-16 10:39:46,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:46,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:39:46,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:46,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:39:46,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:46,856 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 23 treesize of output 22 [2022-10-16 10:39:47,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:47,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:39:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:47,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:39:51,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:51,835 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-10-16 10:39:51,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_5 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:39:51,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_5 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:39:51,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_5 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:39:51,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_5 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648)))) is different from false [2022-10-16 10:39:51,956 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:51,956 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 28 treesize of output 29 [2022-10-16 10:39:51,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:51,965 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 86 treesize of output 74 [2022-10-16 10:39:51,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:39:51,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-10-16 10:39:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 32 not checked. [2022-10-16 10:39:52,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013165817] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:39:52,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:39:52,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 57 [2022-10-16 10:39:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819799316] [2022-10-16 10:39:52,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:39:52,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-10-16 10:39:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:39:52,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-10-16 10:39:52,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2669, Unknown=9, NotChecked=428, Total=3306 [2022-10-16 10:39:52,330 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 58 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 58 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 10:39:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:39:54,292 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2022-10-16 10:39:54,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:39:54,292 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 58 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-10-16 10:39:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:39:54,293 INFO L225 Difference]: With dead ends: 64 [2022-10-16 10:39:54,293 INFO L226 Difference]: Without dead ends: 63 [2022-10-16 10:39:54,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=434, Invalid=5123, Unknown=9, NotChecked=596, Total=6162 [2022-10-16 10:39:54,295 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 133 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:39:54,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 309 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1154 Invalid, 0 Unknown, 364 Unchecked, 0.6s Time] [2022-10-16 10:39:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-16 10:39:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2022-10-16 10:39:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:39:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-10-16 10:39:54,302 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 45 [2022-10-16 10:39:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:39:54,302 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-10-16 10:39:54,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 58 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 10:39:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-10-16 10:39:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-16 10:39:54,303 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:39:54,303 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:39:54,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-16 10:39:54,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 10:39:54,518 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:39:54,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:39:54,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2050411242, now seen corresponding path program 2 times [2022-10-16 10:39:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:39:54,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959434403] [2022-10-16 10:39:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:39:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:39:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:39:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:55,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:39:55,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959434403] [2022-10-16 10:39:55,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959434403] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:39:55,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160804766] [2022-10-16 10:39:55,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:39:55,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:39:55,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:39:55,528 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:39:55,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-10-16 10:39:55,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:39:55,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:39:55,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjunts are in the unsatisfiable core [2022-10-16 10:39:55,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:39:55,826 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 13 treesize of output 9 [2022-10-16 10:39:55,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:55,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:39:56,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:56,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:39:56,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:56,177 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 23 treesize of output 22 [2022-10-16 10:39:56,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:39:56,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:39:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:39:56,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:40:05,413 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:05,414 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-10-16 10:40:05,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2147483649 .cse0)) (< (+ .cse0 2147483648) 0)))) is different from false [2022-10-16 10:40:05,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2147483649 .cse0)) (< (+ .cse0 2147483648) 0)))) is different from false [2022-10-16 10:40:05,476 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ .cse0 2147483648) 0)))) is different from false [2022-10-16 10:40:05,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ .cse0 2147483648) 0)))) is different from false [2022-10-16 10:40:05,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:05,547 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 29 treesize of output 30 [2022-10-16 10:40:05,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:05,558 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 88 treesize of output 76 [2022-10-16 10:40:05,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:05,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-10-16 10:40:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-10-16 10:40:05,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160804766] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:40:05,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:40:05,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 54 [2022-10-16 10:40:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175003781] [2022-10-16 10:40:05,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:40:05,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-10-16 10:40:05,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:40:05,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-10-16 10:40:05,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2374, Unknown=12, NotChecked=404, Total=2970 [2022-10-16 10:40:05,929 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 55 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 55 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 10:40:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:40:07,869 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2022-10-16 10:40:07,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 10:40:07,870 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 55 states have internal predecessors, (130), 0 states have call successors, (0), 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 46 [2022-10-16 10:40:07,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:40:07,871 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:40:07,871 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 10:40:07,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=416, Invalid=4990, Unknown=12, NotChecked=588, Total=6006 [2022-10-16 10:40:07,873 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 168 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:40:07,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 322 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1024 Invalid, 0 Unknown, 388 Unchecked, 0.6s Time] [2022-10-16 10:40:07,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 10:40:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 58. [2022-10-16 10:40:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2022-10-16 10:40:07,880 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 46 [2022-10-16 10:40:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:40:07,880 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2022-10-16 10:40:07,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.4074074074074074) internal successors, (130), 55 states have internal predecessors, (130), 0 states have call successors, (0), 0 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 10:40:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2022-10-16 10:40:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 10:40:07,881 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:40:07,881 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:40:07,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-10-16 10:40:08,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 10:40:08,097 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:40:08,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:40:08,098 INFO L85 PathProgramCache]: Analyzing trace with hash 268986731, now seen corresponding path program 5 times [2022-10-16 10:40:08,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:40:08,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128154807] [2022-10-16 10:40:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:40:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:40:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:40:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 31 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:40:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:40:08,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128154807] [2022-10-16 10:40:08,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128154807] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:40:08,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767118461] [2022-10-16 10:40:08,474 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:40:08,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:40:08,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:40:08,475 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:40:08,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-10-16 10:40:08,586 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-10-16 10:40:08,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:40:08,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 10:40:08,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:40:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 47 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:40:08,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:40:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 40 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:40:09,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767118461] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:40:09,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:40:09,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2022-10-16 10:40:09,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337039241] [2022-10-16 10:40:09,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:40:09,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:40:09,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:40:09,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:40:09,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:40:09,121 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 34 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:40:09,446 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2022-10-16 10:40:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-16 10:40:09,447 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-10-16 10:40:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:40:09,448 INFO L225 Difference]: With dead ends: 103 [2022-10-16 10:40:09,448 INFO L226 Difference]: Without dead ends: 65 [2022-10-16 10:40:09,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 74 SyntacticMatches, 17 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=326, Invalid=1744, Unknown=0, NotChecked=0, Total=2070 [2022-10-16 10:40:09,451 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 122 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:40:09,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 146 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:40:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-16 10:40:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-10-16 10:40:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-10-16 10:40:09,458 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 52 [2022-10-16 10:40:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:40:09,458 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-10-16 10:40:09,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-10-16 10:40:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 10:40:09,459 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:40:09,459 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:40:09,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-10-16 10:40:09,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:40:09,674 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:40:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:40:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1210140263, now seen corresponding path program 6 times [2022-10-16 10:40:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:40:09,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546305233] [2022-10-16 10:40:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:40:09,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:40:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:40:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:40:10,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:40:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546305233] [2022-10-16 10:40:10,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546305233] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:40:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383718067] [2022-10-16 10:40:10,800 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:40:10,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:40:10,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:40:10,802 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:40:10,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-10-16 10:40:10,908 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-10-16 10:40:10,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:40:10,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 10:40:10,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:40:10,919 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 10:40:11,000 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 15 treesize of output 11 [2022-10-16 10:40:11,190 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 20 treesize of output 22 [2022-10-16 10:40:11,450 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 20 treesize of output 22 [2022-10-16 10:40:11,658 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 20 treesize of output 22 [2022-10-16 10:40:11,930 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 25 treesize of output 24 [2022-10-16 10:40:12,196 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-10-16 10:40:12,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 18 [2022-10-16 10:40:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:40:12,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:40:21,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_507 Int)) (or (< (+ v_ArrVal_507 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_507)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648) (< 2147483647 v_ArrVal_507))) is different from false [2022-10-16 10:40:22,382 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_507 Int)) (or (< 2147483647 v_ArrVal_507) (< (+ v_ArrVal_507 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_507)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648))) is different from false [2022-10-16 10:40:22,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:22,390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-10-16 10:40:22,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) is different from false [2022-10-16 10:40:22,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:40:22,453 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648)))) is different from false [2022-10-16 10:40:22,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) is different from false [2022-10-16 10:40:22,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) is different from false [2022-10-16 10:40:22,535 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) is different from false [2022-10-16 10:40:22,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:22,584 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 28 treesize of output 29 [2022-10-16 10:40:22,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:22,596 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 86 treesize of output 74 [2022-10-16 10:40:22,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:22,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-10-16 10:40:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 61 not checked. [2022-10-16 10:40:22,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383718067] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:40:22,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:40:22,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 51 [2022-10-16 10:40:22,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299696169] [2022-10-16 10:40:22,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:40:22,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-10-16 10:40:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:40:22,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-10-16 10:40:22,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1756, Unknown=15, NotChecked=728, Total=2652 [2022-10-16 10:40:22,716 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 52 states, 51 states have (on average 2.4705882352941178) internal successors, (126), 52 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:40:25,425 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2022-10-16 10:40:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:40:25,426 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.4705882352941178) internal successors, (126), 52 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-10-16 10:40:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:40:25,427 INFO L225 Difference]: With dead ends: 103 [2022-10-16 10:40:25,427 INFO L226 Difference]: Without dead ends: 102 [2022-10-16 10:40:25,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=301, Invalid=3376, Unknown=15, NotChecked=1000, Total=4692 [2022-10-16 10:40:25,430 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 100 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 827 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:40:25,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 353 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1089 Invalid, 0 Unknown, 827 Unchecked, 0.6s Time] [2022-10-16 10:40:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-16 10:40:25,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2022-10-16 10:40:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 1.053763440860215) internal successors, (98), 95 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2022-10-16 10:40:25,440 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 56 [2022-10-16 10:40:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:40:25,441 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2022-10-16 10:40:25,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.4705882352941178) internal successors, (126), 52 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2022-10-16 10:40:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 10:40:25,442 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:40:25,442 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:40:25,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-10-16 10:40:25,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:40:25,658 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:40:25,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:40:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1140357432, now seen corresponding path program 3 times [2022-10-16 10:40:25,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:40:25,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231390106] [2022-10-16 10:40:25,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:40:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:40:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:40:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:40:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:40:26,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231390106] [2022-10-16 10:40:26,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231390106] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:40:26,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049188526] [2022-10-16 10:40:26,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:40:26,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:40:26,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:40:26,816 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:40:26,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-10-16 10:40:26,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 10:40:26,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:40:26,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 44 conjunts are in the unsatisfiable core [2022-10-16 10:40:26,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:40:26,944 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 10:40:27,294 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 15 treesize of output 11 [2022-10-16 10:40:27,698 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 20 treesize of output 22 [2022-10-16 10:40:27,914 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 20 treesize of output 22 [2022-10-16 10:40:28,141 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 20 treesize of output 22 [2022-10-16 10:40:28,377 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 25 treesize of output 24 [2022-10-16 10:40:28,804 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-10-16 10:40:28,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 20 [2022-10-16 10:40:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 40 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:40:28,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:40:29,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:29,713 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-10-16 10:40:42,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_11 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_104| 4) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_104| 4))))) (< |c_ULTIMATE.start_main_#t~post6#1| |v_ULTIMATE.start_main_~i~0#1_104|) (< (+ .cse0 2147483648) 0)))) is different from false [2022-10-16 10:40:42,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_11 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_104| 4) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_104| 4))))) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_104|) (< (+ .cse0 2147483648) 0)))) is different from false [2022-10-16 10:40:42,717 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:42,717 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 31 treesize of output 32 [2022-10-16 10:40:42,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:42,727 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 92 treesize of output 80 [2022-10-16 10:40:42,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:42,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2022-10-16 10:40:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 11 proven. 56 refuted. 16 times theorem prover too weak. 0 trivial. 12 not checked. [2022-10-16 10:40:43,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049188526] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:40:43,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:40:43,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 27] total 74 [2022-10-16 10:40:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482075172] [2022-10-16 10:40:43,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:40:43,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-10-16 10:40:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:40:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-10-16 10:40:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=4849, Unknown=18, NotChecked=286, Total=5550 [2022-10-16 10:40:43,587 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand has 75 states, 74 states have (on average 2.2027027027027026) internal successors, (163), 75 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:40:46,082 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2022-10-16 10:40:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:40:46,083 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.2027027027027026) internal successors, (163), 75 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-10-16 10:40:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:40:46,084 INFO L225 Difference]: With dead ends: 105 [2022-10-16 10:40:46,084 INFO L226 Difference]: Without dead ends: 104 [2022-10-16 10:40:46,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=797, Invalid=9293, Unknown=18, NotChecked=398, Total=10506 [2022-10-16 10:40:46,088 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:40:46,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 274 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 433 Invalid, 0 Unknown, 401 Unchecked, 0.3s Time] [2022-10-16 10:40:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-16 10:40:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-10-16 10:40:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 100 states have (on average 1.07) internal successors, (107), 102 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2022-10-16 10:40:46,100 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 57 [2022-10-16 10:40:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:40:46,101 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2022-10-16 10:40:46,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.2027027027027026) internal successors, (163), 75 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-10-16 10:40:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-16 10:40:46,102 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:40:46,102 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:40:46,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-10-16 10:40:46,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:40:46,313 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:40:46,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:40:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash -666829078, now seen corresponding path program 2 times [2022-10-16 10:40:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:40:46,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861917811] [2022-10-16 10:40:46,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:40:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:40:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:40:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:40:46,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:40:46,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861917811] [2022-10-16 10:40:46,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861917811] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:40:46,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272900520] [2022-10-16 10:40:46,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:40:46,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:40:46,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:40:46,495 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:40:46,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-10-16 10:40:46,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:40:46,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:40:46,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:40:46,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:40:46,653 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-10-16 10:40:46,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:40:46,743 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-10-16 10:40:46,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272900520] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:40:46,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:40:46,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:40:46,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392281591] [2022-10-16 10:40:46,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:40:46,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:40:46,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:40:46,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:40:46,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:40:46,746 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 15 states, 14 states have (on average 4.785714285714286) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 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 10:40:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:40:46,955 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-10-16 10:40:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:40:46,956 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.785714285714286) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 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 10:40:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:40:46,957 INFO L225 Difference]: With dead ends: 119 [2022-10-16 10:40:46,957 INFO L226 Difference]: Without dead ends: 118 [2022-10-16 10:40:46,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:40:46,958 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:40:46,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 78 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:40:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-10-16 10:40:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-10-16 10:40:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.0510204081632653) internal successors, (103), 99 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:40:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2022-10-16 10:40:46,974 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 59 [2022-10-16 10:40:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:40:46,974 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2022-10-16 10:40:46,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.785714285714286) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 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 10:40:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2022-10-16 10:40:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-16 10:40:46,975 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:40:46,975 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:40:47,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-10-16 10:40:47,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:40:47,176 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:40:47,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:40:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash -565492381, now seen corresponding path program 7 times [2022-10-16 10:40:47,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:40:47,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956985252] [2022-10-16 10:40:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:40:47,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:40:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:40:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:40:48,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:40:48,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956985252] [2022-10-16 10:40:48,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956985252] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:40:48,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141101710] [2022-10-16 10:40:48,565 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:40:48,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:40:48,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:40:48,567 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:40:48,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-10-16 10:40:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:40:48,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 57 conjunts are in the unsatisfiable core [2022-10-16 10:40:48,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:40:48,679 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 10:40:48,756 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 15 treesize of output 11 [2022-10-16 10:40:48,910 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:40:48,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:40:48,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:40:49,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:40:49,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:40:49,357 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 21 treesize of output 20 [2022-10-16 10:40:49,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-10-16 10:40:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:40:49,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:40:59,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:40:59,795 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-10-16 10:40:59,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:40:59,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:40:59,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:40:59,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:40:59,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:40:59,929 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:40:59,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_669 Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_669)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:40:59,999 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_133| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_133|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_669 Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_133| 4)) v_ArrVal_669)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648) (< 2147483647 .cse0)))))) is different from false [2022-10-16 10:41:00,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_133| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_669 Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_133| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_133| 4)) v_ArrVal_669)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:41:00,073 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-10-16 10:41:00,074 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 2 case distinctions, treesize of input 35 treesize of output 41 [2022-10-16 10:41:00,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:41:00,085 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 86 treesize of output 74 [2022-10-16 10:41:00,093 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:41:00,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-10-16 10:41:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 79 not checked. [2022-10-16 10:41:00,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141101710] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:41:00,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:41:00,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 54 [2022-10-16 10:41:00,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571999821] [2022-10-16 10:41:00,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:41:00,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-10-16 10:41:00,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:41:00,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-10-16 10:41:00,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1916, Unknown=18, NotChecked=864, Total=2970 [2022-10-16 10:41:00,197 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand has 55 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 55 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 10:41:00,601 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_133| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_669 Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_133| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_133| 4)) v_ArrVal_669)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648) (< 2147483647 .cse0)))) (<= |c_ULTIMATE.start_main_~i~0#1| 4) (= (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:41:02,606 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_133| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_133|)) (forall ((v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_669 Int)) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_133| 4)) v_ArrVal_669)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) 2147483648) (< 2147483647 .cse0)))))) (<= (select .cse1 .cse2) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 4 |c_ULTIMATE.start_main_#t~post6#1|))) is different from false [2022-10-16 10:41:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:41:03,843 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2022-10-16 10:41:03,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:41:03,844 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 55 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-10-16 10:41:03,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:41:03,845 INFO L225 Difference]: With dead ends: 116 [2022-10-16 10:41:03,845 INFO L226 Difference]: Without dead ends: 115 [2022-10-16 10:41:03,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 90 SyntacticMatches, 11 SemanticMatches, 68 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=274, Invalid=3172, Unknown=20, NotChecked=1364, Total=4830 [2022-10-16 10:41:03,847 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 81 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 2075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:41:03,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 237 Invalid, 2075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1306 Invalid, 0 Unknown, 739 Unchecked, 0.8s Time] [2022-10-16 10:41:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-10-16 10:41:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 106. [2022-10-16 10:41:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0480769230769231) internal successors, (109), 105 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 10:41:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2022-10-16 10:41:03,861 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 60 [2022-10-16 10:41:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:41:03,861 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2022-10-16 10:41:03,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.3518518518518516) internal successors, (127), 55 states have internal predecessors, (127), 0 states have call successors, (0), 0 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 10:41:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2022-10-16 10:41:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 10:41:03,862 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:41:03,863 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:41:03,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-10-16 10:41:04,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:41:04,077 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:41:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:41:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash -350394548, now seen corresponding path program 4 times [2022-10-16 10:41:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:41:04,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687905707] [2022-10-16 10:41:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:41:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:41:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:41:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:41:05,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:41:05,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687905707] [2022-10-16 10:41:05,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687905707] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:41:05,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966509981] [2022-10-16 10:41:05,375 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:41:05,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:41:05,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:41:05,377 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:41:05,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-10-16 10:41:05,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:41:05,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:41:05,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 55 conjunts are in the unsatisfiable core [2022-10-16 10:41:05,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:41:05,882 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 15 treesize of output 11 [2022-10-16 10:41:06,083 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:41:06,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-10-16 10:41:06,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:06,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:41:06,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:06,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:41:06,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:06,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:41:06,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:06,742 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 23 treesize of output 22 [2022-10-16 10:41:07,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:07,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:41:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:41:07,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:41:08,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_733 Int)) (or (< (+ v_ArrVal_733 2147483648) 0) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_733)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_733 2147483649)))) is different from false [2022-10-16 10:41:12,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:41:12,729 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-10-16 10:41:12,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:41:12,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:41:12,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:41:12,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:41:12,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:41:12,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:41:12,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_728 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_728)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:41:12,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_728 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_728)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_145|)))) is different from false [2022-10-16 10:41:12,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_ArrVal_728 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< |v_ULTIMATE.start_main_~i~0#1_145| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_728)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:41:13,009 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-10-16 10:41:13,009 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-10-16 10:41:13,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:41:13,025 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 88 treesize of output 76 [2022-10-16 10:41:13,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:41:13,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-10-16 10:41:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 85 not checked. [2022-10-16 10:41:13,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966509981] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:41:13,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:41:13,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 26] total 64 [2022-10-16 10:41:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707743303] [2022-10-16 10:41:13,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:41:13,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-10-16 10:41:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:41:13,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-10-16 10:41:13,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2779, Unknown=15, NotChecked=1150, Total=4160 [2022-10-16 10:41:13,160 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand has 65 states, 64 states have (on average 2.4375) internal successors, (156), 65 states have internal predecessors, (156), 0 states have call successors, (0), 0 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 10:41:13,602 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_arrayElimArr_15 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (v_ArrVal_728 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< |v_ULTIMATE.start_main_~i~0#1_145| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_728)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 4) (<= |c_ULTIMATE.start_main_~i~0#1| 4) (= .cse2 0) (<= (mod 0 1) .cse2) (<= 4 |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2022-10-16 10:41:15,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 4 |c_ULTIMATE.start_main_#t~post6#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_145| Int)) (or (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_728 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_15 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_728)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_145|)))) (<= (mod 0 1) (select .cse1 .cse2)))) is different from false [2022-10-16 10:41:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:41:16,906 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2022-10-16 10:41:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:41:16,907 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.4375) internal successors, (156), 65 states have internal predecessors, (156), 0 states have call successors, (0), 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 61 [2022-10-16 10:41:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:41:16,907 INFO L225 Difference]: With dead ends: 115 [2022-10-16 10:41:16,908 INFO L226 Difference]: Without dead ends: 114 [2022-10-16 10:41:16,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 83 SyntacticMatches, 9 SemanticMatches, 76 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=320, Invalid=4001, Unknown=17, NotChecked=1668, Total=6006 [2022-10-16 10:41:16,909 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 105 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 696 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:41:16,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 325 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1670 Invalid, 0 Unknown, 696 Unchecked, 1.0s Time] [2022-10-16 10:41:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-10-16 10:41:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2022-10-16 10:41:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 106 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 10:41:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2022-10-16 10:41:16,922 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 61 [2022-10-16 10:41:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:41:16,923 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2022-10-16 10:41:16,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.4375) internal successors, (156), 65 states have internal predecessors, (156), 0 states have call successors, (0), 0 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 10:41:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2022-10-16 10:41:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-16 10:41:16,924 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:41:16,924 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:41:16,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-10-16 10:41:17,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:41:17,138 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:41:17,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:41:17,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1063572067, now seen corresponding path program 8 times [2022-10-16 10:41:17,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:41:17,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105983425] [2022-10-16 10:41:17,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:41:17,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:41:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:41:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:41:17,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:41:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105983425] [2022-10-16 10:41:17,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105983425] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:41:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581622095] [2022-10-16 10:41:17,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:41:17,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:41:17,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:41:17,613 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:41:17,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-10-16 10:41:17,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:41:17,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:41:17,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 10:41:17,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:41:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:41:18,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:41:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:41:18,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581622095] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:41:18,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:41:18,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2022-10-16 10:41:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721174270] [2022-10-16 10:41:18,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:41:18,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:41:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:41:18,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:41:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2022-10-16 10:41:18,501 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand has 40 states, 40 states have (on average 2.725) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 10:41:19,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:41:19,001 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2022-10-16 10:41:19,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-16 10:41:19,002 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.725) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 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 63 [2022-10-16 10:41:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:41:19,002 INFO L225 Difference]: With dead ends: 116 [2022-10-16 10:41:19,002 INFO L226 Difference]: Without dead ends: 73 [2022-10-16 10:41:19,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 90 SyntacticMatches, 21 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=449, Invalid=2521, Unknown=0, NotChecked=0, Total=2970 [2022-10-16 10:41:19,004 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 138 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:41:19,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 236 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:41:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-16 10:41:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2022-10-16 10:41:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 69 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:41:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-10-16 10:41:19,011 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 63 [2022-10-16 10:41:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:41:19,011 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-10-16 10:41:19,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.725) internal successors, (109), 40 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 10:41:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-10-16 10:41:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-16 10:41:19,012 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:41:19,012 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:41:19,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-10-16 10:41:19,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-10-16 10:41:19,219 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:41:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:41:19,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1182767905, now seen corresponding path program 9 times [2022-10-16 10:41:19,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:41:19,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4741063] [2022-10-16 10:41:19,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:41:19,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:41:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:41:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:41:20,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:41:20,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4741063] [2022-10-16 10:41:20,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4741063] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:41:20,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912993413] [2022-10-16 10:41:20,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:41:20,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:41:20,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:41:20,589 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:41:20,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-10-16 10:41:20,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-10-16 10:41:20,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:41:20,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 45 conjunts are in the unsatisfiable core [2022-10-16 10:41:20,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:41:21,337 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 15 treesize of output 11 [2022-10-16 10:41:21,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:21,817 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 20 treesize of output 22 [2022-10-16 10:41:22,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:22,076 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 20 treesize of output 22 [2022-10-16 10:41:22,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:22,370 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 20 treesize of output 22 [2022-10-16 10:41:22,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:22,655 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 20 treesize of output 22 [2022-10-16 10:41:23,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:23,069 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 25 treesize of output 24 [2022-10-16 10:41:23,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:41:23,619 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-10-16 10:41:23,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 18 [2022-10-16 10:41:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 67 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:41:23,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:41:28,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:41:28,523 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 10:41:53,316 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:41:53,317 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 30 treesize of output 31 [2022-10-16 10:41:53,329 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:41:53,330 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 90 treesize of output 78 [2022-10-16 10:41:53,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:41:53,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2022-10-16 10:41:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 27 proven. 92 refuted. 23 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:41:54,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912993413] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:41:54,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:41:54,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31, 32] total 89 [2022-10-16 10:41:54,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633287588] [2022-10-16 10:41:54,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:41:54,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-10-16 10:41:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:41:54,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-10-16 10:41:54,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=522, Invalid=7378, Unknown=110, NotChecked=0, Total=8010 [2022-10-16 10:41:54,650 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 90 states, 89 states have (on average 2.168539325842697) internal successors, (193), 90 states have internal predecessors, (193), 0 states have call successors, (0), 0 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 10:41:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:41:58,266 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2022-10-16 10:41:58,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-16 10:41:58,267 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 89 states have (on average 2.168539325842697) internal successors, (193), 90 states have internal predecessors, (193), 0 states have call successors, (0), 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 10:41:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:41:58,268 INFO L225 Difference]: With dead ends: 117 [2022-10-16 10:41:58,268 INFO L226 Difference]: Without dead ends: 116 [2022-10-16 10:41:58,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3544 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=1110, Invalid=14529, Unknown=111, NotChecked=0, Total=15750 [2022-10-16 10:41:58,271 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 96 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:41:58,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 274 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 443 Invalid, 0 Unknown, 293 Unchecked, 0.3s Time] [2022-10-16 10:41:58,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-16 10:41:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2022-10-16 10:41:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 110 states have (on average 1.0454545454545454) internal successors, (115), 111 states have internal predecessors, (115), 0 states have call successors, (0), 0 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 10:41:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2022-10-16 10:41:58,286 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 67 [2022-10-16 10:41:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:41:58,287 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2022-10-16 10:41:58,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 89 states have (on average 2.168539325842697) internal successors, (193), 90 states have internal predecessors, (193), 0 states have call successors, (0), 0 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 10:41:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2022-10-16 10:41:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-16 10:41:58,288 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:41:58,288 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:41:58,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-10-16 10:41:58,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-10-16 10:41:58,501 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:41:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:41:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1988900530, now seen corresponding path program 5 times [2022-10-16 10:41:58,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:41:58,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529546506] [2022-10-16 10:41:58,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:41:58,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:41:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:41:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:41:59,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:41:59,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529546506] [2022-10-16 10:41:59,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529546506] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:41:59,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97622369] [2022-10-16 10:41:59,979 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:41:59,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:41:59,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:41:59,980 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:41:59,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-10-16 10:42:00,243 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-10-16 10:42:00,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:42:00,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 64 conjunts are in the unsatisfiable core [2022-10-16 10:42:00,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:42:00,255 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 10:42:00,380 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 15 treesize of output 11 [2022-10-16 10:42:00,541 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 20 treesize of output 22 [2022-10-16 10:42:00,823 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 20 treesize of output 22 [2022-10-16 10:42:01,044 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 20 treesize of output 22 [2022-10-16 10:42:01,278 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 20 treesize of output 22 [2022-10-16 10:42:01,514 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 25 treesize of output 24 [2022-10-16 10:42:01,870 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-10-16 10:42:01,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 20 [2022-10-16 10:42:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 10 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:42:01,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:42:03,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_910 Int)) (or (< (+ v_ArrVal_910 2147483648) 0) (< 0 (+ v_ArrVal_910 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_910)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) is different from false [2022-10-16 10:42:04,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_910 Int)) (or (< (+ v_ArrVal_910 2147483648) 0) (< 0 (+ v_ArrVal_910 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_910)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-10-16 10:42:08,040 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:42:08,040 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-10-16 10:42:08,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_19 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ 2147483648 .cse0) 0) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0))))) is different from false [2022-10-16 10:42:08,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_19 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:08,101 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_19 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:08,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_19 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:08,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_19 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:08,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_19 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:08,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_19 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:08,232 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_19 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:08,284 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:42:08,285 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 29 treesize of output 30 [2022-10-16 10:42:08,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:42:08,297 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 88 treesize of output 76 [2022-10-16 10:42:08,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:42:08,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-10-16 10:42:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 100 not checked. [2022-10-16 10:42:08,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97622369] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:42:08,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:42:08,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 27] total 56 [2022-10-16 10:42:08,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652624398] [2022-10-16 10:42:08,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:42:08,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-16 10:42:08,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:42:08,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-16 10:42:08,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2036, Unknown=12, NotChecked=990, Total=3192 [2022-10-16 10:42:08,473 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand has 57 states, 56 states have (on average 2.75) internal successors, (154), 57 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 10:42:11,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:42:11,355 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2022-10-16 10:42:11,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-16 10:42:11,356 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.75) internal successors, (154), 57 states have internal predecessors, (154), 0 states have call successors, (0), 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 10:42:11,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:42:11,356 INFO L225 Difference]: With dead ends: 120 [2022-10-16 10:42:11,357 INFO L226 Difference]: Without dead ends: 119 [2022-10-16 10:42:11,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 107 SyntacticMatches, 15 SemanticMatches, 68 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=275, Invalid=3293, Unknown=12, NotChecked=1250, Total=4830 [2022-10-16 10:42:11,358 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 91 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 926 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 10:42:11,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 400 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1166 Invalid, 0 Unknown, 926 Unchecked, 0.7s Time] [2022-10-16 10:42:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-16 10:42:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-10-16 10:42:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 118 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 10:42:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2022-10-16 10:42:11,371 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 68 [2022-10-16 10:42:11,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:42:11,371 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2022-10-16 10:42:11,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.75) internal successors, (154), 57 states have internal predecessors, (154), 0 states have call successors, (0), 0 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 10:42:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2022-10-16 10:42:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-16 10:42:11,372 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:42:11,372 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:42:11,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-10-16 10:42:11,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-10-16 10:42:11,573 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:42:11,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:42:11,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1101637285, now seen corresponding path program 10 times [2022-10-16 10:42:11,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:42:11,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659856946] [2022-10-16 10:42:11,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:42:11,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:42:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:42:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:42:13,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:42:13,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659856946] [2022-10-16 10:42:13,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659856946] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:42:13,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282066356] [2022-10-16 10:42:13,324 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:42:13,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:42:13,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:42:13,326 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:42:13,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-10-16 10:42:13,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:42:13,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:42:13,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 64 conjunts are in the unsatisfiable core [2022-10-16 10:42:13,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:42:14,089 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 15 treesize of output 11 [2022-10-16 10:42:14,331 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:42:14,332 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 27 treesize of output 26 [2022-10-16 10:42:14,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:42:14,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 18 treesize of output 20 [2022-10-16 10:42:14,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:42:14,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:42:14,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:42:14,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:42:15,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:42:15,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:42:15,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:42:15,441 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 23 treesize of output 22 [2022-10-16 10:42:15,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:42:15,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:42:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:42:15,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:42:19,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_978 Int)) (or (< 2147483647 v_ArrVal_978) (< (+ v_ArrVal_978 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_978)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 2147483648))) is different from false [2022-10-16 10:42:20,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_978 Int)) (or (< 2147483647 v_ArrVal_978) (< (+ v_ArrVal_978 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_978)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648))) is different from false [2022-10-16 10:42:21,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_978 Int)) (or (< (+ v_ArrVal_978 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_978)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648) (< 2147483647 v_ArrVal_978))) is different from false [2022-10-16 10:42:21,722 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:42:21,723 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-10-16 10:42:21,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:42:21,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:42:21,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648)))) is different from false [2022-10-16 10:42:21,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) is different from false [2022-10-16 10:42:21,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) is different from false [2022-10-16 10:42:21,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648) (< 2147483647 .cse0)))) is different from false [2022-10-16 10:42:21,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648)))) is different from false [2022-10-16 10:42:21,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) is different from false [2022-10-16 10:42:21,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_972 Int) (v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_972)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) 2147483648)))) is different from false [2022-10-16 10:42:21,942 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_198| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_198|)) (forall ((v_ArrVal_972 Int) (v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse0) (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_198| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_972)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))))) is different from false [2022-10-16 10:42:21,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_972 Int) (v_arrayElimArr_21 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_198| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< 2147483647 .cse0) (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_198| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_972)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) is different from false [2022-10-16 10:42:21,998 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-10-16 10:42:21,998 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 2 case distinctions, treesize of input 35 treesize of output 41 [2022-10-16 10:42:22,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:42:22,010 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 86 treesize of output 74 [2022-10-16 10:42:22,020 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:42:22,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-10-16 10:42:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 122 not checked. [2022-10-16 10:42:22,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282066356] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:42:22,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:42:22,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 31] total 78 [2022-10-16 10:42:22,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928922282] [2022-10-16 10:42:22,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:42:22,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-10-16 10:42:22,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:42:22,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-10-16 10:42:22,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3974, Unknown=16, NotChecked=1946, Total=6162 [2022-10-16 10:42:22,166 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand has 79 states, 78 states have (on average 2.358974358974359) internal successors, (184), 79 states have internal predecessors, (184), 0 states have call successors, (0), 0 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 10:42:22,780 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_972 Int) (v_arrayElimArr_21 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_198| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_198| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< 2147483647 .cse0) (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_198| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_972)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0) 2147483648)))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (<= .cse2 (mod 0 1)) (= .cse2 0) (<= |c_ULTIMATE.start_main_~i~0#1| 5)))) is different from false [2022-10-16 10:42:24,784 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select .cse2 .cse3))) (and (<= .cse0 (mod 0 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_198| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_198|)) (forall ((v_ArrVal_972 Int) (v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select v_arrayElimArr_21 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 2147483647 .cse1) (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_198| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_972)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) .cse1) 2147483648)))))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_#t~post6#1|) (= .cse0 0)))) is different from false [2022-10-16 10:42:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:42:27,617 INFO L93 Difference]: Finished difference Result 134 states and 137 transitions. [2022-10-16 10:42:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-10-16 10:42:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 2.358974358974359) internal successors, (184), 79 states have internal predecessors, (184), 0 states have call successors, (0), 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 71 [2022-10-16 10:42:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:42:27,618 INFO L225 Difference]: With dead ends: 134 [2022-10-16 10:42:27,618 INFO L226 Difference]: Without dead ends: 133 [2022-10-16 10:42:27,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 105 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1772 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=505, Invalid=7731, Unknown=18, NotChecked=3088, Total=11342 [2022-10-16 10:42:27,620 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 202 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 3632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1137 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:42:27,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 385 Invalid, 3632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2425 Invalid, 0 Unknown, 1137 Unchecked, 1.4s Time] [2022-10-16 10:42:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-10-16 10:42:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2022-10-16 10:42:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 124 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 10:42:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2022-10-16 10:42:27,636 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 71 [2022-10-16 10:42:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:42:27,636 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2022-10-16 10:42:27,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 2.358974358974359) internal successors, (184), 79 states have internal predecessors, (184), 0 states have call successors, (0), 0 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 10:42:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2022-10-16 10:42:27,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 10:42:27,637 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:42:27,637 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:42:27,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-10-16 10:42:27,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:42:27,845 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:42:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:42:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -208982454, now seen corresponding path program 6 times [2022-10-16 10:42:27,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:42:27,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96737981] [2022-10-16 10:42:27,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:42:27,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:42:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:42:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:42:29,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:42:29,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96737981] [2022-10-16 10:42:29,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96737981] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:42:29,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300985230] [2022-10-16 10:42:29,446 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:42:29,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:42:29,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:42:29,447 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:42:29,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-10-16 10:42:29,581 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-10-16 10:42:29,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:42:29,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 68 conjunts are in the unsatisfiable core [2022-10-16 10:42:29,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:42:29,590 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 10:42:29,702 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 15 treesize of output 11 [2022-10-16 10:42:29,958 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-10-16 10:42:29,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-10-16 10:42:30,190 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 20 treesize of output 22 [2022-10-16 10:42:30,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-10-16 10:42:30,671 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 20 treesize of output 22 [2022-10-16 10:42:30,931 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 20 treesize of output 22 [2022-10-16 10:42:31,191 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 25 treesize of output 24 [2022-10-16 10:42:31,569 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-10-16 10:42:31,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 20 [2022-10-16 10:42:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:42:31,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:42:33,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1047 Int)) (or (< (+ v_ArrVal_1047 2147483648) 0) (< 0 (+ 2147483649 v_ArrVal_1047 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1047)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) is different from false [2022-10-16 10:42:46,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:42:46,883 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-10-16 10:42:46,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:46,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:46,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:46,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:46,999 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:47,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:47,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:47,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:47,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 Int) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1042)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:47,143 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_213|)) (forall ((v_ArrVal_1042 Int) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_213| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1042)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))))) is different from false [2022-10-16 10:42:47,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (v_ArrVal_1042 Int) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_213| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_213| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1042)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse0)) (< (+ 2147483648 .cse0) 0)))) is different from false [2022-10-16 10:42:47,203 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-10-16 10:42:47,204 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-10-16 10:42:47,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:42:47,215 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 88 treesize of output 76 [2022-10-16 10:42:47,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:42:47,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-10-16 10:42:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 123 not checked. [2022-10-16 10:42:47,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300985230] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:42:47,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:42:47,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 30] total 64 [2022-10-16 10:42:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030062053] [2022-10-16 10:42:47,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:42:47,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-10-16 10:42:47,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:42:47,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-10-16 10:42:47,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2599, Unknown=21, NotChecked=1356, Total=4160 [2022-10-16 10:42:47,371 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand has 65 states, 64 states have (on average 2.59375) internal successors, (166), 65 states have internal predecessors, (166), 0 states have call successors, (0), 0 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 10:42:47,718 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (v_ArrVal_1042 Int) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_213| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_213| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1042)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse1)) (< (+ 2147483648 .cse1) 0)))) (<= |c_ULTIMATE.start_main_~i~0#1| 5))) is different from false [2022-10-16 10:42:49,722 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_#t~post6#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_213|)) (forall ((v_ArrVal_1042 Int) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (select v_arrayElimArr_23 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_213| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1042)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2)) (< (+ 2147483648 .cse2) 0)))))) (= (select .cse0 .cse1) 0))) is different from false [2022-10-16 10:42:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:42:52,618 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2022-10-16 10:42:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 10:42:52,619 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.59375) internal successors, (166), 65 states have internal predecessors, (166), 0 states have call successors, (0), 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 72 [2022-10-16 10:42:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:42:52,621 INFO L225 Difference]: With dead ends: 168 [2022-10-16 10:42:52,621 INFO L226 Difference]: Without dead ends: 167 [2022-10-16 10:42:52,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 109 SyntacticMatches, 15 SemanticMatches, 80 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=318, Invalid=4271, Unknown=23, NotChecked=2030, Total=6642 [2022-10-16 10:42:52,622 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 77 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1222 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:42:52,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 456 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1054 Invalid, 0 Unknown, 1222 Unchecked, 0.6s Time] [2022-10-16 10:42:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-10-16 10:42:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-10-16 10:42:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 165 states have (on average 1.0363636363636364) internal successors, (171), 166 states have internal predecessors, (171), 0 states have call successors, (0), 0 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 10:42:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 171 transitions. [2022-10-16 10:42:52,641 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 171 transitions. Word has length 72 [2022-10-16 10:42:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:42:52,642 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 171 transitions. [2022-10-16 10:42:52,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.59375) internal successors, (166), 65 states have internal predecessors, (166), 0 states have call successors, (0), 0 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 10:42:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2022-10-16 10:42:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-10-16 10:42:52,643 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:42:52,643 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:42:52,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-10-16 10:42:52,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-16 10:42:52,856 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:42:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:42:52,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1095598348, now seen corresponding path program 7 times [2022-10-16 10:42:52,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:42:52,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724931683] [2022-10-16 10:42:52,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:42:52,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:42:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:42:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 91 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:42:53,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:42:53,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724931683] [2022-10-16 10:42:53,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724931683] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:42:53,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810185891] [2022-10-16 10:42:53,481 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:42:53,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:42:53,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:42:53,485 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:42:53,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-10-16 10:42:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:42:53,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2022-10-16 10:42:53,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:42:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 117 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:42:54,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:42:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 117 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:42:54,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810185891] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:42:54,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:42:54,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2022-10-16 10:42:54,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623935940] [2022-10-16 10:42:54,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:42:54,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-16 10:42:54,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:42:54,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-16 10:42:54,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1784, Unknown=0, NotChecked=0, Total=2070 [2022-10-16 10:42:54,704 INFO L87 Difference]: Start difference. First operand 167 states and 171 transitions. Second operand has 46 states, 46 states have (on average 2.782608695652174) internal successors, (128), 46 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 10:42:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:42:55,244 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2022-10-16 10:42:55,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-16 10:42:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.782608695652174) internal successors, (128), 46 states have internal predecessors, (128), 0 states have call successors, (0), 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 10:42:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:42:55,246 INFO L225 Difference]: With dead ends: 172 [2022-10-16 10:42:55,246 INFO L226 Difference]: Without dead ends: 122 [2022-10-16 10:42:55,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 108 SyntacticMatches, 25 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1913 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=592, Invalid=3440, Unknown=0, NotChecked=0, Total=4032 [2022-10-16 10:42:55,247 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 111 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:42:55,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 164 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:42:55,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-10-16 10:42:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-10-16 10:42:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 121 states have internal predecessors, (124), 0 states have call successors, (0), 0 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 10:42:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2022-10-16 10:42:55,262 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 75 [2022-10-16 10:42:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:42:55,263 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2022-10-16 10:42:55,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.782608695652174) internal successors, (128), 46 states have internal predecessors, (128), 0 states have call successors, (0), 0 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 10:42:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2022-10-16 10:42:55,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 10:42:55,264 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:42:55,264 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:42:55,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-10-16 10:42:55,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-10-16 10:42:55,478 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 10:42:55,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:42:55,478 INFO L85 PathProgramCache]: Analyzing trace with hash 154121542, now seen corresponding path program 8 times [2022-10-16 10:42:55,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:42:55,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385466777] [2022-10-16 10:42:55,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:42:55,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:42:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:42:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:42:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:42:57,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385466777] [2022-10-16 10:42:57,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385466777] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:42:57,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572671334] [2022-10-16 10:42:57,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:42:57,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:42:57,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:42:57,241 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:42:57,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-10-16 10:42:57,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:42:57,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:42:57,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 70 conjunts are in the unsatisfiable core [2022-10-16 10:42:57,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:42:57,370 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 10:42:57,476 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 15 treesize of output 11 [2022-10-16 10:42:57,752 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-10-16 10:42:57,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-10-16 10:42:57,982 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-10-16 10:42:57,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-10-16 10:42:58,210 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 20 treesize of output 22 [2022-10-16 10:42:58,452 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 20 treesize of output 22 [2022-10-16 10:42:58,689 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 20 treesize of output 22 [2022-10-16 10:42:58,928 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 20 treesize of output 22 [2022-10-16 10:42:59,177 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 25 treesize of output 24 [2022-10-16 10:42:59,551 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-10-16 10:42:59,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 20 [2022-10-16 10:42:59,610 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 3 proven. 197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:42:59,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:43:01,226 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1180 Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2147483649 v_ArrVal_1180)) (< (+ v_ArrVal_1180 2147483648) 0))) is different from false [2022-10-16 10:43:02,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1180 Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1180)) (< (+ v_ArrVal_1180 2147483648) 0))) is different from false [2022-10-16 10:43:03,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1180 Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1180)) (< (+ v_ArrVal_1180 2147483648) 0))) is different from false [2022-10-16 10:43:03,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:43:03,388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-10-16 10:43:03,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:43:03,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:43:03,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:43:03,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:43:03,509 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:43:03,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post7#1| 4) 20 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ .cse0 2147483648) 0)))) is different from false [2022-10-16 10:43:03,567 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:43:03,591 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2147483649 .cse0)) (< (+ .cse0 2147483648) 0)))) is different from false [2022-10-16 10:43:03,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1175 Int) (v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:43:03,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_242| Int)) (or (forall ((v_ArrVal_1175 Int) (v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ .cse0 2147483648) 0)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_242|)))) is different from false [2022-10-16 10:43:03,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_242| Int) (v_ArrVal_1175 Int) (v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ .cse0 2147483648) 0) (< |v_ULTIMATE.start_main_~i~0#1_242| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2022-10-16 10:43:03,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (v_ArrVal_1175 Int) (v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1172) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< |v_ULTIMATE.start_main_~i~0#1_242| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2022-10-16 10:43:03,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_243| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_243|)) (forall ((v_ArrVal_1172 Int) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (v_ArrVal_1175 Int) (v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_242| (+ |v_ULTIMATE.start_main_~i~0#1_243| 1)) (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1172) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) is different from false [2022-10-16 10:43:03,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1172 Int) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (v_ArrVal_1175 Int) (v_arrayElimArr_25 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_243| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_242| (+ |v_ULTIMATE.start_main_~i~0#1_243| 1)) (< (+ .cse0 2147483648) 0) (< |v_ULTIMATE.start_main_~i~0#1_243| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1172) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-10-16 10:43:03,825 INFO L356 Elim1Store]: treesize reduction 94, result has 28.2 percent of original size [2022-10-16 10:43:03,826 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 3 case distinctions, treesize of input 43 treesize of output 54 [2022-10-16 10:43:03,837 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:43:03,837 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 88 treesize of output 76 [2022-10-16 10:43:03,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:43:03,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-10-16 10:43:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 155 not checked. [2022-10-16 10:43:03,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572671334] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:43:03,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:43:03,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 33] total 71 [2022-10-16 10:43:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702520965] [2022-10-16 10:43:03,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:43:03,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-10-16 10:43:03,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:43:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-10-16 10:43:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2814, Unknown=17, NotChecked=2074, Total=5112 [2022-10-16 10:43:03,989 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand has 72 states, 71 states have (on average 2.507042253521127) internal successors, (178), 72 states have internal predecessors, (178), 0 states have call successors, (0), 0 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 10:43:04,545 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (forall ((v_ArrVal_1172 Int) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (v_ArrVal_1175 Int) (v_arrayElimArr_25 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_243| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_242| (+ |v_ULTIMATE.start_main_~i~0#1_243| 1)) (< (+ .cse1 2147483648) 0) (< |v_ULTIMATE.start_main_~i~0#1_243| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< 0 (+ 2147483649 .cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1172) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) (<= |c_ULTIMATE.start_main_~i~0#1| 5))) is different from false [2022-10-16 10:43:06,550 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 5 |c_ULTIMATE.start_main_#t~post6#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_243| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_243|)) (forall ((v_ArrVal_1172 Int) (|v_ULTIMATE.start_main_~i~0#1_242| Int) (v_ArrVal_1175 Int) (v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< |v_ULTIMATE.start_main_~i~0#1_242| (+ |v_ULTIMATE.start_main_~i~0#1_243| 1)) (< (+ .cse0 2147483648) 0) (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_243| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1172) (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) (= (select .cse1 .cse2) 0))) is different from false [2022-10-16 10:43:06,613 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_242| Int) (v_ArrVal_1175 Int) (v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (< (+ .cse0 2147483648) 0) (< |v_ULTIMATE.start_main_~i~0#1_242| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) (<= 6 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse1 .cse2) 0))) is different from false [2022-10-16 10:43:08,618 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 6 |c_ULTIMATE.start_main_#t~post6#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_242| Int)) (or (forall ((v_ArrVal_1175 Int) (v_arrayElimArr_25 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_25 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ 2147483649 .cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_242| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1175)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (< (+ .cse0 2147483648) 0)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post6#1| 1) |v_ULTIMATE.start_main_~i~0#1_242|)))) (= (select .cse1 .cse2) 0))) is different from false