/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/s22iff.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:48:52,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:48:52,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:48:52,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:48:52,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:48:52,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:48:52,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:48:52,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:48:52,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:48:52,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:48:52,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:48:52,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:48:52,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:48:52,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:48:52,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:48:52,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:48:52,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:48:52,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:48:52,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:48:52,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:48:52,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:48:52,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:48:52,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:48:52,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:48:52,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:48:52,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:48:52,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:48:52,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:48:52,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:48:52,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:48:52,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:48:52,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:48:52,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:48:52,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:48:52,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:48:52,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:48:52,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:48:52,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:48:52,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:48:52,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:48:52,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:48:52,208 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:48:52,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:48:52,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:48:52,258 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:48:52,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:48:52,261 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:48:52,261 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:48:52,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:48:52,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:48:52,264 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:48:52,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:48:52,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:48:52,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:48:52,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:48:52,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:48:52,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:48:52,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:48:52,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:48:52,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:48:52,267 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:48:52,267 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:48:52,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:48:52,267 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:48:52,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:48:52,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:48:52,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:48:52,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:48:52,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:48:52,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:48:52,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:48:52,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:48:52,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:48:52,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:48:52,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:48:52,270 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:48:52,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:48:52,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:48:52,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:48:52,689 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:48:52,690 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:48:52,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s22iff.c [2022-10-16 10:48:52,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fe227d8/63f38b6570574c54b41ed6090cb4fc48/FLAGea22264a7 [2022-10-16 10:48:53,403 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:48:53,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s22iff.c [2022-10-16 10:48:53,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fe227d8/63f38b6570574c54b41ed6090cb4fc48/FLAGea22264a7 [2022-10-16 10:48:53,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fe227d8/63f38b6570574c54b41ed6090cb4fc48 [2022-10-16 10:48:53,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:48:53,774 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:48:53,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:48:53,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:48:53,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:48:53,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:48:53" (1/1) ... [2022-10-16 10:48:53,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b8a28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:53, skipping insertion in model container [2022-10-16 10:48:53,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:48:53" (1/1) ... [2022-10-16 10:48:53,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:48:53,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:48:53,963 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/s22iff.c[589,602] [2022-10-16 10:48:53,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:48:53,999 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:48:54,015 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/s22iff.c[589,602] [2022-10-16 10:48:54,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:48:54,044 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:48:54,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54 WrapperNode [2022-10-16 10:48:54,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:48:54,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:48:54,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:48:54,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:48:54,056 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:48:54" (1/1) ... [2022-10-16 10:48:54,066 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:48:54" (1/1) ... [2022-10-16 10:48:54,094 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2022-10-16 10:48:54,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:48:54,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:48:54,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:48:54,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:48:54,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54" (1/1) ... [2022-10-16 10:48:54,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54" (1/1) ... [2022-10-16 10:48:54,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54" (1/1) ... [2022-10-16 10:48:54,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54" (1/1) ... [2022-10-16 10:48:54,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54" (1/1) ... [2022-10-16 10:48:54,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54" (1/1) ... [2022-10-16 10:48:54,124 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54" (1/1) ... [2022-10-16 10:48:54,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54" (1/1) ... [2022-10-16 10:48:54,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:48:54,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:48:54,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:48:54,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:48:54,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54" (1/1) ... [2022-10-16 10:48:54,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:48:54,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:54,167 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:48:54,195 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:48:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:48:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:48:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:48:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:48:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:48:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:48:54,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:48:54,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:48:54,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:48:54,337 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:48:54,340 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:48:54,658 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:48:54,668 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:48:54,669 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 10:48:54,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:48:54 BoogieIcfgContainer [2022-10-16 10:48:54,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:48:54,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:48:54,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:48:54,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:48:54,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:48:53" (1/3) ... [2022-10-16 10:48:54,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586bdf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:48:54, skipping insertion in model container [2022-10-16 10:48:54,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:48:54" (2/3) ... [2022-10-16 10:48:54,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586bdf7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:48:54, skipping insertion in model container [2022-10-16 10:48:54,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:48:54" (3/3) ... [2022-10-16 10:48:54,685 INFO L112 eAbstractionObserver]: Analyzing ICFG s22iff.c [2022-10-16 10:48:54,741 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:48:54,741 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-16 10:48:54,845 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:48:54,855 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;@7c8dc3fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:48:54,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-16 10:48:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:48:54,871 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:54,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:54,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:54,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:54,881 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:48:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:54,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577804200] [2022-10-16 10:48:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:55,112 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:48:55,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:55,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577804200] [2022-10-16 10:48:55,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577804200] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:48:55,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:48:55,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:48:55,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194517050] [2022-10-16 10:48:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:48:55,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:48:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:48:55,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:48:55,172 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:48:55,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:55,208 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2022-10-16 10:48:55,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:48:55,211 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:48:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:55,223 INFO L225 Difference]: With dead ends: 104 [2022-10-16 10:48:55,225 INFO L226 Difference]: Without dead ends: 48 [2022-10-16 10:48:55,231 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:48:55,238 INFO L413 NwaCegarLoop]: 59 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, 59 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:48:55,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:48:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-16 10:48:55,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-16 10:48:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.625) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-10-16 10:48:55,298 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 8 [2022-10-16 10:48:55,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:55,300 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-10-16 10:48:55,301 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:48:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-10-16 10:48:55,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:48:55,302 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:55,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:55,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:48:55,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:55,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:55,305 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:48:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:55,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100234043] [2022-10-16 10:48:55,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:55,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:55,614 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:48:55,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:55,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100234043] [2022-10-16 10:48:55,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100234043] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:48:55,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:48:55,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:48:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523749029] [2022-10-16 10:48:55,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:48:55,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:48:55,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:55,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:48:55,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:48:55,622 INFO L87 Difference]: Start difference. First operand 48 states and 52 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:48:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:55,746 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-10-16 10:48:55,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:48:55,747 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:48:55,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:55,749 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:48:55,749 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 10:48:55,749 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:48:55,751 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:55,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 97 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:48:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 10:48:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2022-10-16 10:48:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-10-16 10:48:55,762 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 8 [2022-10-16 10:48:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:55,762 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-10-16 10:48:55,763 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:48:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-10-16 10:48:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 10:48:55,764 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:55,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:55,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:48:55,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:55,765 INFO L85 PathProgramCache]: Analyzing trace with hash 678258903, now seen corresponding path program 1 times [2022-10-16 10:48:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:55,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877033917] [2022-10-16 10:48:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:55,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:55,910 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:48:55,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:55,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877033917] [2022-10-16 10:48:55,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877033917] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:48:55,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:48:55,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:48:55,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31790367] [2022-10-16 10:48:55,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:48:55,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:48:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:55,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:48:55,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:48:55,917 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 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:48:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:56,026 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-10-16 10:48:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:48:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-10-16 10:48:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:56,028 INFO L225 Difference]: With dead ends: 118 [2022-10-16 10:48:56,029 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:48:56,029 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:48:56,031 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 81 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:56,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:48:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:48:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. [2022-10-16 10:48:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 51 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:48:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-10-16 10:48:56,045 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2022-10-16 10:48:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:56,046 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-10-16 10:48:56,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 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:48:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-10-16 10:48:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:48:56,047 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:56,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:56,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:48:56,049 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:56,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:48:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:56,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906333904] [2022-10-16 10:48:56,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:56,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:56,199 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:48:56,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:56,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906333904] [2022-10-16 10:48:56,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906333904] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:56,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486581450] [2022-10-16 10:48:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:56,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:56,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:56,209 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:48:56,210 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:48:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:56,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:48:56,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:56,336 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:48:56,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:56,394 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:48:56,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486581450] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:56,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:56,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:48:56,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286711947] [2022-10-16 10:48:56,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:56,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:48:56,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:56,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:48:56,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:48:56,399 INFO L87 Difference]: Start difference. First operand 52 states and 56 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:48:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:56,610 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-10-16 10:48:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:48:56,611 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:48:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:56,614 INFO L225 Difference]: With dead ends: 99 [2022-10-16 10:48:56,614 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 10:48:56,615 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:48:56,617 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 89 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:56,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 157 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:48:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 10:48:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2022-10-16 10:48:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-10-16 10:48:56,629 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 12 [2022-10-16 10:48:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:56,630 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-10-16 10:48:56,630 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:48:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-10-16 10:48:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:48:56,631 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:56,631 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:56,673 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:48:56,845 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:48:56,846 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:56,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:48:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:56,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164682270] [2022-10-16 10:48:56,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:56,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:56,945 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:48:56,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:56,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164682270] [2022-10-16 10:48:56,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164682270] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:56,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415059121] [2022-10-16 10:48:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:56,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:56,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:56,948 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:48:56,975 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:48:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:57,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:48:57,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:57,059 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:48:57,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:48:57,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415059121] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:48:57,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:48:57,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:48:57,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674962074] [2022-10-16 10:48:57,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:48:57,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:48:57,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:57,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:48:57,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:48:57,063 INFO L87 Difference]: Start difference. First operand 63 states and 72 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:48:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:57,168 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-10-16 10:48:57,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:48:57,169 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:48:57,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:57,170 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:48:57,170 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 10:48:57,171 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:48:57,172 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 40 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:57,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 110 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:48:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 10:48:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2022-10-16 10:48:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.4375) internal successors, (69), 61 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:48:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-10-16 10:48:57,181 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 13 [2022-10-16 10:48:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:57,182 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-10-16 10:48:57,182 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:48:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-10-16 10:48:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:48:57,183 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:57,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:57,222 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:48:57,398 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:48:57,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:57,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash -825622317, now seen corresponding path program 1 times [2022-10-16 10:48:57,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:57,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589932419] [2022-10-16 10:48:57,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:57,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:57,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589932419] [2022-10-16 10:48:57,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589932419] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:57,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111336346] [2022-10-16 10:48:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:57,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:57,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:57,805 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:48:57,806 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:48:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:57,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-16 10:48:57,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:57,940 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 18 treesize of output 14 [2022-10-16 10:48:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:58,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:58,083 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 14 treesize of output 12 [2022-10-16 10:48:58,092 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 18 treesize of output 16 [2022-10-16 10:48:58,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:58,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111336346] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:58,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:58,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-10-16 10:48:58,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587050271] [2022-10-16 10:48:58,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:58,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 10:48:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:58,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 10:48:58,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-10-16 10:48:58,115 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:48:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:58,244 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2022-10-16 10:48:58,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 10:48:58,245 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 10:48:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:58,246 INFO L225 Difference]: With dead ends: 121 [2022-10-16 10:48:58,247 INFO L226 Difference]: Without dead ends: 86 [2022-10-16 10:48:58,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:48:58,251 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:58,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 205 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:48:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-16 10:48:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2022-10-16 10:48:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 62 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:48:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-10-16 10:48:58,268 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 14 [2022-10-16 10:48:58,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:58,272 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-10-16 10:48:58,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 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:48:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-10-16 10:48:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:48:58,275 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:58,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:58,332 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:48:58,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:58,493 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:58,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:58,493 INFO L85 PathProgramCache]: Analyzing trace with hash -825622509, now seen corresponding path program 1 times [2022-10-16 10:48:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:58,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520184512] [2022-10-16 10:48:58,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:58,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:58,576 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:48:58,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:58,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520184512] [2022-10-16 10:48:58,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520184512] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:48:58,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:48:58,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:48:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109471025] [2022-10-16 10:48:58,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:48:58,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:48:58,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:58,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:48:58,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:48:58,581 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:58,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:58,635 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-10-16 10:48:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:48:58,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 10:48:58,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:58,636 INFO L225 Difference]: With dead ends: 63 [2022-10-16 10:48:58,637 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 10:48:58,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:48:58,638 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:58,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:48:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 10:48:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-16 10:48:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:48:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-10-16 10:48:58,647 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2022-10-16 10:48:58,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:58,648 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-10-16 10:48:58,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-10-16 10:48:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 10:48:58,649 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:58,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:58,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 10:48:58,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:58,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1157615292, now seen corresponding path program 1 times [2022-10-16 10:48:58,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:58,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311560849] [2022-10-16 10:48:58,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:58,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:58,707 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:48:58,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:58,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311560849] [2022-10-16 10:48:58,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311560849] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:48:58,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:48:58,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:48:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821521222] [2022-10-16 10:48:58,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:48:58,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:48:58,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:58,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:48:58,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:48:58,711 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:58,766 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-10-16 10:48:58,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:48:58,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 10:48:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:58,768 INFO L225 Difference]: With dead ends: 82 [2022-10-16 10:48:58,768 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:48:58,769 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:48:58,770 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 92 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:48:58,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 92 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:48:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:48:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-10-16 10:48:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 65 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:48:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-10-16 10:48:58,779 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2022-10-16 10:48:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:58,779 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-10-16 10:48:58,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-10-16 10:48:58,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 10:48:58,781 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:58,781 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:58,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 10:48:58,782 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:58,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:58,783 INFO L85 PathProgramCache]: Analyzing trace with hash 250320491, now seen corresponding path program 1 times [2022-10-16 10:48:58,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:58,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618440486] [2022-10-16 10:48:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:58,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:58,918 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:48:58,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:58,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618440486] [2022-10-16 10:48:58,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618440486] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:58,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936500031] [2022-10-16 10:48:58,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:58,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:58,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:58,938 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:48:58,950 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:48:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:59,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:48:59,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:59,111 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:48:59,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:59,195 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:48:59,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936500031] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:59,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:59,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:48:59,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410685168] [2022-10-16 10:48:59,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:59,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:48:59,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:59,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:48:59,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:48:59,198 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:59,436 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-10-16 10:48:59,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:48:59,437 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-16 10:48:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:59,438 INFO L225 Difference]: With dead ends: 155 [2022-10-16 10:48:59,438 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 10:48:59,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:48:59,440 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 113 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:59,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 307 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:48:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 10:48:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2022-10-16 10:48:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.356164383561644) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:48:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-10-16 10:48:59,452 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 21 [2022-10-16 10:48:59,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:59,452 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-10-16 10:48:59,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-10-16 10:48:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:48:59,454 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:59,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:59,492 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:48:59,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:59,669 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:59,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash 38416049, now seen corresponding path program 1 times [2022-10-16 10:48:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:59,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005719193] [2022-10-16 10:48:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:59,688 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:48:59,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122319326] [2022-10-16 10:48:59,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:59,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:59,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:59,690 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:48:59,697 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:48:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:59,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-16 10:48:59,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:59,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-10-16 10:48:59,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 10:48:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:48:59,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:59,986 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 37 treesize of output 31 [2022-10-16 10:48:59,992 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 10:48:59,993 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 38 treesize of output 24 [2022-10-16 10:49:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:49:00,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:00,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005719193] [2022-10-16 10:49:00,008 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:00,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122319326] [2022-10-16 10:49:00,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122319326] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:00,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:00,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-10-16 10:49:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615832061] [2022-10-16 10:49:00,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:00,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:49:00,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:00,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:49:00,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:49:00,011 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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:49:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:00,304 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2022-10-16 10:49:00,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:49:00,304 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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 23 [2022-10-16 10:49:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:00,306 INFO L225 Difference]: With dead ends: 153 [2022-10-16 10:49:00,306 INFO L226 Difference]: Without dead ends: 126 [2022-10-16 10:49:00,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:49:00,307 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 94 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:00,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 319 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:49:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-10-16 10:49:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2022-10-16 10:49:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 96 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:49:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2022-10-16 10:49:00,319 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 23 [2022-10-16 10:49:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:00,320 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2022-10-16 10:49:00,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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:49:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-10-16 10:49:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:49:00,321 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:00,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:00,360 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:49:00,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-16 10:49:00,536 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash 38415857, now seen corresponding path program 1 times [2022-10-16 10:49:00,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:00,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147621748] [2022-10-16 10:49:00,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:00,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:49:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:00,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147621748] [2022-10-16 10:49:00,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147621748] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:49:00,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:49:00,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:49:00,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627756439] [2022-10-16 10:49:00,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:49:00,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:49:00,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:00,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:49:00,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:49:00,799 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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:49:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:00,877 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-10-16 10:49:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 10:49:00,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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 23 [2022-10-16 10:49:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:00,880 INFO L225 Difference]: With dead ends: 108 [2022-10-16 10:49:00,880 INFO L226 Difference]: Without dead ends: 106 [2022-10-16 10:49:00,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 10:49:00,882 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:00,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 115 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-16 10:49:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-10-16 10:49:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 101 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:49:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2022-10-16 10:49:00,902 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 23 [2022-10-16 10:49:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:00,902 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2022-10-16 10:49:00,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 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:49:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-10-16 10:49:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:49:00,905 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:00,905 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:00,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 10:49:00,906 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:00,906 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:49:00,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:00,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611944746] [2022-10-16 10:49:00,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:01,108 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:49:01,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:01,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611944746] [2022-10-16 10:49:01,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611944746] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:01,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775518954] [2022-10-16 10:49:01,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:49:01,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:01,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:01,111 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:49:01,115 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:49:01,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:49:01,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:01,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:49:01,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:01,229 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:49:01,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:01,277 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:49:01,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775518954] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:01,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:01,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:49:01,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78755660] [2022-10-16 10:49:01,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:01,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:49:01,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:01,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:49:01,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:49:01,282 INFO L87 Difference]: Start difference. First operand 102 states and 121 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:49:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:01,523 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2022-10-16 10:49:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:49:01,523 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:49:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:01,524 INFO L225 Difference]: With dead ends: 124 [2022-10-16 10:49:01,525 INFO L226 Difference]: Without dead ends: 123 [2022-10-16 10:49:01,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:49:01,529 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 206 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:01,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 170 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-10-16 10:49:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 91. [2022-10-16 10:49:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:49:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-10-16 10:49:01,559 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 24 [2022-10-16 10:49:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:01,560 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-10-16 10:49:01,560 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:49:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-10-16 10:49:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 10:49:01,563 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:01,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:01,599 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:49:01,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:01,764 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:01,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:01,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1920559343, now seen corresponding path program 2 times [2022-10-16 10:49:01,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:01,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165971629] [2022-10-16 10:49:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:02,160 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:49:02,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:02,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165971629] [2022-10-16 10:49:02,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165971629] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:02,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129185723] [2022-10-16 10:49:02,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:49:02,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:02,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:02,163 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:49:02,187 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:49:02,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:49:02,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:02,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 10:49:02,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:02,259 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:49:02,334 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:02,334 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 25 treesize of output 24 [2022-10-16 10:49:02,389 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:49:02,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:02,460 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 16 treesize of output 14 [2022-10-16 10:49:02,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:49:02,485 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:49:02,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129185723] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:02,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:02,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2022-10-16 10:49:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039013670] [2022-10-16 10:49:02,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:02,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:49:02,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:49:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:49:02,488 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:49:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:02,767 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2022-10-16 10:49:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:49:02,767 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 10:49:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:02,768 INFO L225 Difference]: With dead ends: 156 [2022-10-16 10:49:02,769 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 10:49:02,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:49:02,770 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:02,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 317 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:49:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 10:49:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2022-10-16 10:49:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-10-16 10:49:02,780 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 25 [2022-10-16 10:49:02,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:02,781 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-10-16 10:49:02,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:49:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-10-16 10:49:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:49:02,782 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:02,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:02,822 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:49:02,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:02,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1985602653, now seen corresponding path program 1 times [2022-10-16 10:49:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:02,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134217806] [2022-10-16 10:49:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:49:03,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:03,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134217806] [2022-10-16 10:49:03,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134217806] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:49:03,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:49:03,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:49:03,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488300827] [2022-10-16 10:49:03,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:49:03,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:49:03,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:03,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:49:03,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:49:03,053 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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:49:03,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:03,106 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2022-10-16 10:49:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:49:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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:49:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:03,108 INFO L225 Difference]: With dead ends: 105 [2022-10-16 10:49:03,108 INFO L226 Difference]: Without dead ends: 103 [2022-10-16 10:49:03,108 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:49:03,109 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 99 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:49:03,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 99 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:49:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-16 10:49:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-10-16 10:49:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 100 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:49:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-10-16 10:49:03,118 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 26 [2022-10-16 10:49:03,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:03,119 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-10-16 10:49:03,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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:49:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-10-16 10:49:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 10:49:03,120 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:03,120 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:03,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 10:49:03,121 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:03,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2118394144, now seen corresponding path program 1 times [2022-10-16 10:49:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:03,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58427632] [2022-10-16 10:49:03,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:03,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:49:03,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:03,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58427632] [2022-10-16 10:49:03,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58427632] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:03,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631853853] [2022-10-16 10:49:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:03,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:03,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:03,211 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:49:03,221 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:49:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:03,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:49:03,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:49:03,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:49:03,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631853853] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:03,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:03,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:49:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198840615] [2022-10-16 10:49:03,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:03,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:49:03,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:03,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:49:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:49:03,366 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 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:49:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:03,515 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2022-10-16 10:49:03,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:49:03,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-16 10:49:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:03,519 INFO L225 Difference]: With dead ends: 148 [2022-10-16 10:49:03,519 INFO L226 Difference]: Without dead ends: 147 [2022-10-16 10:49:03,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 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:49:03,524 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 68 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:03,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 152 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-10-16 10:49:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2022-10-16 10:49:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 131 states have internal predecessors, (165), 0 states have call successors, (0), 0 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:49:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 165 transitions. [2022-10-16 10:49:03,557 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 165 transitions. Word has length 28 [2022-10-16 10:49:03,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:03,559 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 165 transitions. [2022-10-16 10:49:03,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 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:49:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 165 transitions. [2022-10-16 10:49:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:49:03,563 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:03,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:03,607 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:49:03,779 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,SelfDestructingSolverStorable14 [2022-10-16 10:49:03,779 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1245709113, now seen corresponding path program 1 times [2022-10-16 10:49:03,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:03,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819468255] [2022-10-16 10:49:03,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:49:03,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819468255] [2022-10-16 10:49:03,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819468255] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488546071] [2022-10-16 10:49:03,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:03,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:03,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:03,892 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:49:03,919 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:49:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:03,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:49:03,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:49:04,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:49:04,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488546071] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:49:04,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:49:04,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:49:04,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754681842] [2022-10-16 10:49:04,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:49:04,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:49:04,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:04,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:49:04,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:49:04,007 INFO L87 Difference]: Start difference. First operand 132 states and 165 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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:49:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:04,087 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-10-16 10:49:04,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:49:04,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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 29 [2022-10-16 10:49:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:04,089 INFO L225 Difference]: With dead ends: 134 [2022-10-16 10:49:04,089 INFO L226 Difference]: Without dead ends: 133 [2022-10-16 10:49:04,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 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:49:04,090 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:04,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 142 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-10-16 10:49:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-10-16 10:49:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.322314049586777) internal successors, (160), 130 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:49:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2022-10-16 10:49:04,101 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 29 [2022-10-16 10:49:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:04,102 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2022-10-16 10:49:04,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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:49:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-10-16 10:49:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 10:49:04,103 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:04,103 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:04,136 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:49:04,316 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,SelfDestructingSolverStorable15 [2022-10-16 10:49:04,317 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash 874414924, now seen corresponding path program 1 times [2022-10-16 10:49:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:04,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697400201] [2022-10-16 10:49:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:04,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:04,333 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:49:04,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915743284] [2022-10-16 10:49:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:04,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:04,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:04,335 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:49:04,344 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:49:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:04,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:49:04,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:04,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:49:04,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:49:04,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:04,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697400201] [2022-10-16 10:49:04,561 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:04,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915743284] [2022-10-16 10:49:04,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915743284] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:04,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:04,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-10-16 10:49:04,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445542596] [2022-10-16 10:49:04,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:04,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:49:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:04,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:49:04,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:49:04,564 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:04,756 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2022-10-16 10:49:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:49:04,757 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-16 10:49:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:04,758 INFO L225 Difference]: With dead ends: 143 [2022-10-16 10:49:04,758 INFO L226 Difference]: Without dead ends: 110 [2022-10-16 10:49:04,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-10-16 10:49:04,759 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 63 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:04,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 239 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-16 10:49:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2022-10-16 10:49:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 104 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:49:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2022-10-16 10:49:04,768 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 30 [2022-10-16 10:49:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:04,768 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2022-10-16 10:49:04,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-10-16 10:49:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 10:49:04,769 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:04,769 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:04,805 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:49:04,983 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,SelfDestructingSolverStorable16 [2022-10-16 10:49:04,983 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1892149553, now seen corresponding path program 3 times [2022-10-16 10:49:04,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:04,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386904620] [2022-10-16 10:49:04,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:05,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:05,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386904620] [2022-10-16 10:49:05,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386904620] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:05,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049539139] [2022-10-16 10:49:05,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:49:05,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:05,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:05,169 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:49:05,188 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:49:05,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:49:05,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:05,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:49:05,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:05,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:05,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049539139] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:05,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:05,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:49:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353419619] [2022-10-16 10:49:05,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:05,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:49:05,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:49:05,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:49:05,531 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 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:49:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:05,849 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2022-10-16 10:49:05,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:49:05,850 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-16 10:49:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:05,851 INFO L225 Difference]: With dead ends: 238 [2022-10-16 10:49:05,851 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:49:05,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:49:05,853 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 204 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:05,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 259 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:49:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:49:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 142. [2022-10-16 10:49:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.303030303030303) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 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:49:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2022-10-16 10:49:05,865 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 32 [2022-10-16 10:49:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:05,865 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2022-10-16 10:49:05,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 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:49:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2022-10-16 10:49:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:49:05,866 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:05,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:05,908 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:49:06,081 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,SelfDestructingSolverStorable17 [2022-10-16 10:49:06,081 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:06,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1277475512, now seen corresponding path program 2 times [2022-10-16 10:49:06,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:06,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894173277] [2022-10-16 10:49:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:06,100 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:49:06,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1751025585] [2022-10-16 10:49:06,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:49:06,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:06,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:06,102 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:49:06,108 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:49:06,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:49:06,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:06,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:49:06,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:49:06,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:49:06,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:06,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894173277] [2022-10-16 10:49:06,324 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:06,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751025585] [2022-10-16 10:49:06,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751025585] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:06,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:06,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-10-16 10:49:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999990638] [2022-10-16 10:49:06,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:06,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:49:06,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:06,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:49:06,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:49:06,328 INFO L87 Difference]: Start difference. First operand 142 states and 172 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:06,540 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2022-10-16 10:49:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 10:49:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-10-16 10:49:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:06,541 INFO L225 Difference]: With dead ends: 187 [2022-10-16 10:49:06,541 INFO L226 Difference]: Without dead ends: 144 [2022-10-16 10:49:06,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-10-16 10:49:06,544 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:06,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 163 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-10-16 10:49:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2022-10-16 10:49:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.2878787878787878) internal successors, (170), 141 states have internal predecessors, (170), 0 states have call successors, (0), 0 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:49:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2022-10-16 10:49:06,557 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 34 [2022-10-16 10:49:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:06,557 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2022-10-16 10:49:06,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2022-10-16 10:49:06,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:49:06,559 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:06,559 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:06,596 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:49:06,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:06,774 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:06,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:06,775 INFO L85 PathProgramCache]: Analyzing trace with hash 315378123, now seen corresponding path program 4 times [2022-10-16 10:49:06,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:06,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253478736] [2022-10-16 10:49:06,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:06,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:07,522 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:49:07,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:07,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253478736] [2022-10-16 10:49:07,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253478736] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:07,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339070053] [2022-10-16 10:49:07,523 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:49:07,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:07,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:07,527 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:49:07,547 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:49:07,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:49:07,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:07,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 10:49:07,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:07,673 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:49:07,748 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:07,749 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 25 treesize of output 24 [2022-10-16 10:49:07,821 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:07,822 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 25 treesize of output 24 [2022-10-16 10:49:07,916 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:49:07,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:08,079 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 16 treesize of output 14 [2022-10-16 10:49:08,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:49:08,107 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:49:08,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339070053] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:08,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:08,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 32 [2022-10-16 10:49:08,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268429106] [2022-10-16 10:49:08,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:08,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:49:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:08,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:49:08,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:49:08,110 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:08,885 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-10-16 10:49:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:49:08,886 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-10-16 10:49:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:08,887 INFO L225 Difference]: With dead ends: 199 [2022-10-16 10:49:08,887 INFO L226 Difference]: Without dead ends: 146 [2022-10-16 10:49:08,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2022-10-16 10:49:08,888 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 76 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:08,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 740 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 10:49:08,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-10-16 10:49:08,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2022-10-16 10:49:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 132 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:49:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2022-10-16 10:49:08,901 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 36 [2022-10-16 10:49:08,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:08,901 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2022-10-16 10:49:08,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2022-10-16 10:49:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:49:08,902 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:08,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:08,944 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:49:09,116 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,SelfDestructingSolverStorable19 [2022-10-16 10:49:09,116 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:09,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:09,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1855075176, now seen corresponding path program 3 times [2022-10-16 10:49:09,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:09,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616336125] [2022-10-16 10:49:09,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:09,134 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:49:09,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057499354] [2022-10-16 10:49:09,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:49:09,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:09,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:09,136 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:49:09,158 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:49:09,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:49:09,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:09,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-16 10:49:09,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:09,239 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:49:09,338 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 37 treesize of output 17 [2022-10-16 10:49:09,578 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:49:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:49:09,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:09,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_76| c_~N~0)))) is different from false [2022-10-16 10:49:10,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_76| 1)) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_76| 1))) is different from false [2022-10-16 10:49:10,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (< |c_ULTIMATE.start_main_#t~post7#1| |v_ULTIMATE.start_main_~i~0#1_76|))) is different from false [2022-10-16 10:49:10,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_467 (Array Int Int))) (or (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_467) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_76|))) is different from false [2022-10-16 10:49:10,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:10,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-10-16 10:49:10,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:10,367 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 42 treesize of output 38 [2022-10-16 10:49:10,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-10-16 10:49:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2022-10-16 10:49:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:10,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616336125] [2022-10-16 10:49:10,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:10,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057499354] [2022-10-16 10:49:10,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057499354] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:10,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:10,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-10-16 10:49:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872839692] [2022-10-16 10:49:10,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:10,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 10:49:10,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:10,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 10:49:10,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=605, Unknown=10, NotChecked=212, Total=930 [2022-10-16 10:49:10,529 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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:49:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:11,214 INFO L93 Difference]: Finished difference Result 188 states and 231 transitions. [2022-10-16 10:49:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:49:11,214 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:49:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:11,216 INFO L225 Difference]: With dead ends: 188 [2022-10-16 10:49:11,216 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:49:11,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=1188, Unknown=25, NotChecked=300, Total=1722 [2022-10-16 10:49:11,218 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 37 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:11,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 306 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 347 Unchecked, 0.1s Time] [2022-10-16 10:49:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:49:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-10-16 10:49:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 158 states have internal predecessors, (192), 0 states have call successors, (0), 0 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:49:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 192 transitions. [2022-10-16 10:49:11,232 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 192 transitions. Word has length 41 [2022-10-16 10:49:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:11,232 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 192 transitions. [2022-10-16 10:49:11,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 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:49:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 192 transitions. [2022-10-16 10:49:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:49:11,233 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:11,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:11,274 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:49:11,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:11,447 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:11,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:11,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1855074984, now seen corresponding path program 1 times [2022-10-16 10:49:11,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:11,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099730138] [2022-10-16 10:49:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:11,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:49:11,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:11,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099730138] [2022-10-16 10:49:11,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099730138] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:11,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702587296] [2022-10-16 10:49:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:11,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:11,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:11,868 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:49:11,892 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:49:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:11,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjunts are in the unsatisfiable core [2022-10-16 10:49:11,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:11,963 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:49:11,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:49:11,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:12,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:12,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:12,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:12,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-10-16 10:49:12,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:12,315 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 58 treesize of output 30 [2022-10-16 10:49:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:49:12,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:12,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 Int) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_509 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_86| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_509))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_509 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_510)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_86| 4))))) (or (< 3 .cse0) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse0) v_ArrVal_510) (< (+ v_ArrVal_510 .cse2) 9223372036854775808) (< 3 .cse2)))))) is different from false [2022-10-16 10:49:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2022-10-16 10:49:13,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702587296] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:13,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:13,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2022-10-16 10:49:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432717554] [2022-10-16 10:49:13,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:13,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:49:13,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:13,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:49:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=325, Unknown=1, NotChecked=38, Total=462 [2022-10-16 10:49:13,360 INFO L87 Difference]: Start difference. First operand 159 states and 192 transitions. Second operand has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:13,536 INFO L93 Difference]: Finished difference Result 185 states and 224 transitions. [2022-10-16 10:49:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:49:13,537 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:49:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:13,539 INFO L225 Difference]: With dead ends: 185 [2022-10-16 10:49:13,539 INFO L226 Difference]: Without dead ends: 184 [2022-10-16 10:49:13,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=419, Unknown=1, NotChecked=44, Total=600 [2022-10-16 10:49:13,541 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:13,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 222 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 89 Unchecked, 0.0s Time] [2022-10-16 10:49:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-16 10:49:13,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 175. [2022-10-16 10:49:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 165 states have (on average 1.290909090909091) internal successors, (213), 174 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 213 transitions. [2022-10-16 10:49:13,556 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 213 transitions. Word has length 41 [2022-10-16 10:49:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:13,557 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 213 transitions. [2022-10-16 10:49:13,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 213 transitions. [2022-10-16 10:49:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 10:49:13,558 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:13,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:13,600 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:49:13,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:13,771 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1672749764, now seen corresponding path program 1 times [2022-10-16 10:49:13,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:13,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971489549] [2022-10-16 10:49:13,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:13,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:49:14,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:14,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971489549] [2022-10-16 10:49:14,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971489549] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:14,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566254873] [2022-10-16 10:49:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:14,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:14,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:14,042 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:49:14,049 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:49:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:14,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 10:49:14,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:14,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:49:14,226 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:14,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 31 [2022-10-16 10:49:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:49:14,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:49:14,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566254873] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:49:14,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:49:14,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-10-16 10:49:14,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84824997] [2022-10-16 10:49:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:49:14,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:49:14,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:14,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:49:14,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-16 10:49:14,262 INFO L87 Difference]: Start difference. First operand 175 states and 213 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:49:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:14,366 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2022-10-16 10:49:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 10:49:14,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-10-16 10:49:14,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:14,369 INFO L225 Difference]: With dead ends: 175 [2022-10-16 10:49:14,369 INFO L226 Difference]: Without dead ends: 174 [2022-10-16 10:49:14,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:49:14,371 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:14,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 75 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-10-16 10:49:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-10-16 10:49:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 165 states have (on average 1.2606060606060605) internal successors, (208), 173 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:49:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2022-10-16 10:49:14,395 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 42 [2022-10-16 10:49:14,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:14,396 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2022-10-16 10:49:14,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:49:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2022-10-16 10:49:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 10:49:14,397 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:14,398 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:14,461 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:49:14,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-10-16 10:49:14,611 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:14,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1687435661, now seen corresponding path program 5 times [2022-10-16 10:49:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:14,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429565609] [2022-10-16 10:49:14,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:14,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:14,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429565609] [2022-10-16 10:49:14,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429565609] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:14,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861553316] [2022-10-16 10:49:14,987 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:49:14,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:14,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:14,989 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:49:15,006 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:49:15,086 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:49:15,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:15,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:49:15,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:15,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:15,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861553316] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:15,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:15,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2022-10-16 10:49:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291820836] [2022-10-16 10:49:15,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:15,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 10:49:15,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 10:49:15,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:49:15,510 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:16,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:16,094 INFO L93 Difference]: Finished difference Result 330 states and 395 transitions. [2022-10-16 10:49:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:49:16,094 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-10-16 10:49:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:16,096 INFO L225 Difference]: With dead ends: 330 [2022-10-16 10:49:16,096 INFO L226 Difference]: Without dead ends: 255 [2022-10-16 10:49:16,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:49:16,098 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 190 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:16,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 339 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:49:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-10-16 10:49:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 218. [2022-10-16 10:49:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 209 states have (on average 1.2344497607655502) internal successors, (258), 217 states have internal predecessors, (258), 0 states have call successors, (0), 0 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:49:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2022-10-16 10:49:16,119 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 258 transitions. Word has length 43 [2022-10-16 10:49:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:16,119 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 258 transitions. [2022-10-16 10:49:16,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 258 transitions. [2022-10-16 10:49:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 10:49:16,120 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:16,121 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:16,168 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:49:16,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:16,331 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1194758214, now seen corresponding path program 1 times [2022-10-16 10:49:16,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:16,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670595694] [2022-10-16 10:49:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:16,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:49:16,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:16,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670595694] [2022-10-16 10:49:16,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670595694] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:16,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775008561] [2022-10-16 10:49:16,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:16,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:16,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:16,428 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:49:16,453 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:49:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:16,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:49:16,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:49:16,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:49:16,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775008561] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:16,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:16,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:49:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262452460] [2022-10-16 10:49:16,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:16,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:49:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:16,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:49:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:49:16,586 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 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:49:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:16,750 INFO L93 Difference]: Finished difference Result 292 states and 351 transitions. [2022-10-16 10:49:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:49:16,751 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 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 44 [2022-10-16 10:49:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:16,752 INFO L225 Difference]: With dead ends: 292 [2022-10-16 10:49:16,752 INFO L226 Difference]: Without dead ends: 291 [2022-10-16 10:49:16,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 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:49:16,754 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 112 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:16,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 188 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-10-16 10:49:16,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 266. [2022-10-16 10:49:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 257 states have (on average 1.2879377431906616) internal successors, (331), 265 states have internal predecessors, (331), 0 states have call successors, (0), 0 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:49:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 331 transitions. [2022-10-16 10:49:16,778 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 331 transitions. Word has length 44 [2022-10-16 10:49:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:16,778 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 331 transitions. [2022-10-16 10:49:16,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 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:49:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 331 transitions. [2022-10-16 10:49:16,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 10:49:16,779 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:16,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:16,818 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:49:16,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:16,993 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:16,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1617200910, now seen corresponding path program 1 times [2022-10-16 10:49:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:16,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500767206] [2022-10-16 10:49:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:49:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:17,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500767206] [2022-10-16 10:49:17,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500767206] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:17,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499964313] [2022-10-16 10:49:17,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:17,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:17,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:17,086 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:49:17,105 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:49:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:17,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:49:17,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:49:17,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:49:17,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499964313] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:49:17,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:49:17,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:49:17,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104918402] [2022-10-16 10:49:17,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:49:17,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:49:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:17,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:49:17,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:49:17,201 INFO L87 Difference]: Start difference. First operand 266 states and 331 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:17,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:17,282 INFO L93 Difference]: Finished difference Result 268 states and 331 transitions. [2022-10-16 10:49:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:49:17,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-10-16 10:49:17,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:17,284 INFO L225 Difference]: With dead ends: 268 [2022-10-16 10:49:17,284 INFO L226 Difference]: Without dead ends: 267 [2022-10-16 10:49:17,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 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:49:17,285 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:17,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:49:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-10-16 10:49:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-10-16 10:49:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 264 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:49:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 321 transitions. [2022-10-16 10:49:17,308 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 321 transitions. Word has length 45 [2022-10-16 10:49:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:17,308 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 321 transitions. [2022-10-16 10:49:17,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 321 transitions. [2022-10-16 10:49:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:49:17,309 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:17,309 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:17,353 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:49:17,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:17,523 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:17,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:17,523 INFO L85 PathProgramCache]: Analyzing trace with hash 411246071, now seen corresponding path program 6 times [2022-10-16 10:49:17,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:17,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368838454] [2022-10-16 10:49:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:17,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:18,630 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:49:18,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:18,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368838454] [2022-10-16 10:49:18,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368838454] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:18,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589588272] [2022-10-16 10:49:18,631 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:49:18,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:18,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:18,632 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:49:18,655 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:49:18,760 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-10-16 10:49:18,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:18,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-16 10:49:18,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:18,892 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:49:18,966 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:18,966 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 25 treesize of output 24 [2022-10-16 10:49:19,097 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:19,097 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 25 treesize of output 24 [2022-10-16 10:49:19,193 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:19,194 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 25 treesize of output 24 [2022-10-16 10:49:19,297 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:49:19,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:19,545 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 16 treesize of output 14 [2022-10-16 10:49:19,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:49:19,579 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:49:19,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589588272] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:19,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:19,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 42 [2022-10-16 10:49:19,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302237325] [2022-10-16 10:49:19,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:19,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-16 10:49:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:19,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-16 10:49:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2022-10-16 10:49:19,583 INFO L87 Difference]: Start difference. First operand 265 states and 321 transitions. Second operand has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:49:20,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:20,707 INFO L93 Difference]: Finished difference Result 343 states and 418 transitions. [2022-10-16 10:49:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:49:20,708 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 0 states have call successors, (0), 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 47 [2022-10-16 10:49:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:20,709 INFO L225 Difference]: With dead ends: 343 [2022-10-16 10:49:20,710 INFO L226 Difference]: Without dead ends: 275 [2022-10-16 10:49:20,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=2511, Unknown=0, NotChecked=0, Total=2756 [2022-10-16 10:49:20,712 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:20,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 859 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 10:49:20,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-10-16 10:49:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-10-16 10:49:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 253 states have (on average 1.2411067193675889) internal successors, (314), 260 states have internal predecessors, (314), 0 states have call successors, (0), 0 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:49:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 314 transitions. [2022-10-16 10:49:20,734 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 314 transitions. Word has length 47 [2022-10-16 10:49:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:20,734 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 314 transitions. [2022-10-16 10:49:20,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:49:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 314 transitions. [2022-10-16 10:49:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-16 10:49:20,735 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:20,735 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:20,772 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:49:20,951 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,SelfDestructingSolverStorable26 [2022-10-16 10:49:20,952 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:20,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:20,953 INFO L85 PathProgramCache]: Analyzing trace with hash 377560238, now seen corresponding path program 1 times [2022-10-16 10:49:20,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:20,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592812667] [2022-10-16 10:49:20,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:20,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-16 10:49:21,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:21,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592812667] [2022-10-16 10:49:21,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592812667] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:21,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351898230] [2022-10-16 10:49:21,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:21,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:21,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:21,047 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:49:21,073 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:49:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:21,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 10:49:21,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:49:21,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:49:21,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351898230] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:21,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:21,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 24 [2022-10-16 10:49:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722883201] [2022-10-16 10:49:21,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:21,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 10:49:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 10:49:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-10-16 10:49:21,439 INFO L87 Difference]: Start difference. First operand 261 states and 314 transitions. Second operand has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:49:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:22,016 INFO L93 Difference]: Finished difference Result 571 states and 679 transitions. [2022-10-16 10:49:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:49:22,017 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 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 49 [2022-10-16 10:49:22,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:22,020 INFO L225 Difference]: With dead ends: 571 [2022-10-16 10:49:22,020 INFO L226 Difference]: Without dead ends: 564 [2022-10-16 10:49:22,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=508, Invalid=1748, Unknown=0, NotChecked=0, Total=2256 [2022-10-16 10:49:22,022 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 531 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:22,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 314 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:49:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-10-16 10:49:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 339. [2022-10-16 10:49:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 331 states have (on average 1.2356495468277946) internal successors, (409), 338 states have internal predecessors, (409), 0 states have call successors, (0), 0 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:49:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 409 transitions. [2022-10-16 10:49:22,055 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 409 transitions. Word has length 49 [2022-10-16 10:49:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:22,055 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 409 transitions. [2022-10-16 10:49:22,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:49:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 409 transitions. [2022-10-16 10:49:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 10:49:22,056 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:22,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:22,100 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:49:22,271 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,SelfDestructingSolverStorable27 [2022-10-16 10:49:22,272 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 522181700, now seen corresponding path program 4 times [2022-10-16 10:49:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:22,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125689307] [2022-10-16 10:49:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:22,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:22,291 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:49:22,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918023586] [2022-10-16 10:49:22,291 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:49:22,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:22,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:22,293 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:49:22,314 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:49:22,394 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:49:22,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:22,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:49:22,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:22,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:49:22,655 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:22,656 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 25 treesize of output 24 [2022-10-16 10:49:22,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:49:22,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:49:22,804 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 19 treesize of output 7 [2022-10-16 10:49:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:49:22,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:22,883 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |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)) 3)) is different from false [2022-10-16 10:49:22,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:49:22,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= (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_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2022-10-16 10:49:22,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)) (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= 3 (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_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))))) is different from false [2022-10-16 10:49:22,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 3 (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_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2022-10-16 10:49:23,012 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (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|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3))) is different from false [2022-10-16 10:49:25,104 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:49:25,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:49:25,113 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:25,113 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 38 treesize of output 34 [2022-10-16 10:49:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 24 not checked. [2022-10-16 10:49:25,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:25,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125689307] [2022-10-16 10:49:25,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:25,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918023586] [2022-10-16 10:49:25,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918023586] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:25,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:25,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-10-16 10:49:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050644797] [2022-10-16 10:49:25,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:25,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 10:49:25,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 10:49:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=510, Unknown=6, NotChecked=306, Total=930 [2022-10-16 10:49:25,243 INFO L87 Difference]: Start difference. First operand 339 states and 409 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:26,206 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-10-16 10:49:28,230 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse1) 3) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)) (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (<= 1 |c_ULTIMATE.start_main_#t~post7#1|))) is different from false [2022-10-16 10:49:30,332 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3)) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse0 .cse2) 3) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3))))) is different from false [2022-10-16 10:49:31,425 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_800 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse1 .cse0) 3) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int) (v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-10-16 10:49:33,445 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_800 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse1 .cse0) 3) (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)) (forall ((v_ArrVal_800 (Array Int Int)) (v_ArrVal_798 Int)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_798)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))))) is different from false [2022-10-16 10:49:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:33,798 INFO L93 Difference]: Finished difference Result 525 states and 651 transitions. [2022-10-16 10:49:33,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-16 10:49:33,798 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-10-16 10:49:33,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:33,801 INFO L225 Difference]: With dead ends: 525 [2022-10-16 10:49:33,801 INFO L226 Difference]: Without dead ends: 456 [2022-10-16 10:49:33,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=167, Invalid=796, Unknown=11, NotChecked=748, Total=1722 [2022-10-16 10:49:33,803 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 90 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:33,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 357 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 507 Invalid, 0 Unknown, 512 Unchecked, 0.3s Time] [2022-10-16 10:49:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-10-16 10:49:33,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 363. [2022-10-16 10:49:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 355 states have (on average 1.2253521126760563) internal successors, (435), 362 states have internal predecessors, (435), 0 states have call successors, (0), 0 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:49:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 435 transitions. [2022-10-16 10:49:33,838 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 435 transitions. Word has length 52 [2022-10-16 10:49:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:33,839 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 435 transitions. [2022-10-16 10:49:33,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 435 transitions. [2022-10-16 10:49:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-16 10:49:33,840 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:33,840 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:33,876 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:49:34,055 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,SelfDestructingSolverStorable28 [2022-10-16 10:49:34,055 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:34,056 INFO L85 PathProgramCache]: Analyzing trace with hash 819079367, now seen corresponding path program 7 times [2022-10-16 10:49:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:34,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157481865] [2022-10-16 10:49:34,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:34,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:34,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157481865] [2022-10-16 10:49:34,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157481865] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:34,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235052080] [2022-10-16 10:49:34,470 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:49:34,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:34,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:34,471 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:49:34,484 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:49:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:34,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 10:49:34,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:34,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:35,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235052080] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:35,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:35,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2022-10-16 10:49:35,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599012945] [2022-10-16 10:49:35,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:35,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:49:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:35,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:49:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:49:35,174 INFO L87 Difference]: Start difference. First operand 363 states and 435 transitions. Second operand has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:36,131 INFO L93 Difference]: Finished difference Result 544 states and 648 transitions. [2022-10-16 10:49:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-16 10:49:36,133 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-10-16 10:49:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:36,136 INFO L225 Difference]: With dead ends: 544 [2022-10-16 10:49:36,136 INFO L226 Difference]: Without dead ends: 458 [2022-10-16 10:49:36,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 78 SyntacticMatches, 17 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=599, Invalid=3183, Unknown=0, NotChecked=0, Total=3782 [2022-10-16 10:49:36,140 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 332 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:36,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 338 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:49:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-10-16 10:49:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 386. [2022-10-16 10:49:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 378 states have (on average 1.216931216931217) internal successors, (460), 385 states have internal predecessors, (460), 0 states have call successors, (0), 0 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:49:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 460 transitions. [2022-10-16 10:49:36,177 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 460 transitions. Word has length 54 [2022-10-16 10:49:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:36,177 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 460 transitions. [2022-10-16 10:49:36,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 460 transitions. [2022-10-16 10:49:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 10:49:36,179 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:36,179 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:36,218 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:49:36,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:36,393 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:36,394 INFO L85 PathProgramCache]: Analyzing trace with hash -878456120, now seen corresponding path program 5 times [2022-10-16 10:49:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:36,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519239418] [2022-10-16 10:49:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:36,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:36,416 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:49:36,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [768297202] [2022-10-16 10:49:36,416 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:49:36,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:36,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:36,417 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:49:36,435 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:49:36,561 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:49:36,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:36,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-16 10:49:36,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:49:36,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:49:36,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:36,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519239418] [2022-10-16 10:49:36,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:36,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768297202] [2022-10-16 10:49:36,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768297202] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:36,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:36,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-10-16 10:49:36,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239584827] [2022-10-16 10:49:36,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:36,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 10:49:36,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:36,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 10:49:36,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-10-16 10:49:36,991 INFO L87 Difference]: Start difference. First operand 386 states and 460 transitions. Second operand has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:37,679 INFO L93 Difference]: Finished difference Result 482 states and 560 transitions. [2022-10-16 10:49:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:49:37,679 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-10-16 10:49:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:37,684 INFO L225 Difference]: With dead ends: 482 [2022-10-16 10:49:37,685 INFO L226 Difference]: Without dead ends: 400 [2022-10-16 10:49:37,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=371, Invalid=1699, Unknown=0, NotChecked=0, Total=2070 [2022-10-16 10:49:37,687 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 202 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:37,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 313 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:49:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-10-16 10:49:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 396. [2022-10-16 10:49:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 388 states have (on average 1.208762886597938) internal successors, (469), 395 states have internal predecessors, (469), 0 states have call successors, (0), 0 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:49:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 469 transitions. [2022-10-16 10:49:37,724 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 469 transitions. Word has length 55 [2022-10-16 10:49:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:37,724 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 469 transitions. [2022-10-16 10:49:37,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 469 transitions. [2022-10-16 10:49:37,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 10:49:37,725 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:37,726 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:37,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:37,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:37,940 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash -970475837, now seen corresponding path program 8 times [2022-10-16 10:49:37,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:37,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810349542] [2022-10-16 10:49:37,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:37,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:39,002 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:49:39,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:39,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810349542] [2022-10-16 10:49:39,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810349542] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:39,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397189397] [2022-10-16 10:49:39,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:49:39,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:39,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:39,004 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:49:39,024 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:49:39,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:49:39,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:39,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 10:49:39,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:39,170 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:49:39,223 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:39,223 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 25 treesize of output 24 [2022-10-16 10:49:39,280 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:39,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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:49:39,379 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:39,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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:49:39,487 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:39,488 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 25 treesize of output 24 [2022-10-16 10:49:39,611 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:49:39,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:39,772 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 16 treesize of output 14 [2022-10-16 10:49:39,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:49:39,832 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:49:39,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397189397] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:39,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:39,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 32 [2022-10-16 10:49:39,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238014198] [2022-10-16 10:49:39,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:39,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:49:39,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:39,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:49:39,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:49:39,837 INFO L87 Difference]: Start difference. First operand 396 states and 469 transitions. Second operand has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:49:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:41,106 INFO L93 Difference]: Finished difference Result 541 states and 660 transitions. [2022-10-16 10:49:41,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 10:49:41,107 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 0 states have call successors, (0), 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 58 [2022-10-16 10:49:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:41,109 INFO L225 Difference]: With dead ends: 541 [2022-10-16 10:49:41,109 INFO L226 Difference]: Without dead ends: 423 [2022-10-16 10:49:41,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:49:41,111 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 106 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:41,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 866 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1788 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 10:49:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-10-16 10:49:41,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 398. [2022-10-16 10:49:41,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 390 states have (on average 1.2076923076923076) internal successors, (471), 397 states have internal predecessors, (471), 0 states have call successors, (0), 0 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:49:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 471 transitions. [2022-10-16 10:49:41,150 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 471 transitions. Word has length 58 [2022-10-16 10:49:41,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:41,151 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 471 transitions. [2022-10-16 10:49:41,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:49:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 471 transitions. [2022-10-16 10:49:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-16 10:49:41,152 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:41,152 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:41,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:41,365 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,SelfDestructingSolverStorable31 [2022-10-16 10:49:41,366 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1085736359, now seen corresponding path program 6 times [2022-10-16 10:49:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:41,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785702492] [2022-10-16 10:49:41,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:41,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:49:41,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406839959] [2022-10-16 10:49:41,385 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:49:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:41,386 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:49:41,408 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:49:41,502 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-10-16 10:49:41,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:41,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 49 conjunts are in the unsatisfiable core [2022-10-16 10:49:41,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:41,515 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:49:41,842 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 37 treesize of output 17 [2022-10-16 10:49:42,169 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:49:42,325 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:49:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:49:42,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:42,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_999) |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:49:42,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:49:42,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_999) |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:49:42,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_999) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:49:43,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:43,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-10-16 10:49:43,042 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:43,042 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 38 treesize of output 34 [2022-10-16 10:49:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 9 trivial. 11 not checked. [2022-10-16 10:49:43,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:43,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785702492] [2022-10-16 10:49:43,398 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:43,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406839959] [2022-10-16 10:49:43,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406839959] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:43,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:43,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 40 [2022-10-16 10:49:43,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197717015] [2022-10-16 10:49:43,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:43,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:49:43,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:43,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:49:43,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1118, Unknown=5, NotChecked=284, Total=1560 [2022-10-16 10:49:43,402 INFO L87 Difference]: Start difference. First operand 398 states and 471 transitions. Second operand has 40 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:44,919 INFO L93 Difference]: Finished difference Result 400 states and 471 transitions. [2022-10-16 10:49:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-10-16 10:49:44,919 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-10-16 10:49:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:44,921 INFO L225 Difference]: With dead ends: 400 [2022-10-16 10:49:44,921 INFO L226 Difference]: Without dead ends: 356 [2022-10-16 10:49:44,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=367, Invalid=2612, Unknown=7, NotChecked=436, Total=3422 [2022-10-16 10:49:44,923 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 113 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 800 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:44,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 443 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 481 Invalid, 0 Unknown, 800 Unchecked, 0.3s Time] [2022-10-16 10:49:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-10-16 10:49:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-10-16 10:49:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 348 states have (on average 1.2270114942528736) internal successors, (427), 355 states have internal predecessors, (427), 0 states have call successors, (0), 0 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:49:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 427 transitions. [2022-10-16 10:49:44,953 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 427 transitions. Word has length 59 [2022-10-16 10:49:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:44,954 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 427 transitions. [2022-10-16 10:49:44,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 427 transitions. [2022-10-16 10:49:44,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 10:49:44,955 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:44,955 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:44,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:45,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-10-16 10:49:45,169 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:45,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2026433844, now seen corresponding path program 2 times [2022-10-16 10:49:45,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:45,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665188971] [2022-10-16 10:49:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:49:45,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:45,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665188971] [2022-10-16 10:49:45,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665188971] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:45,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600264999] [2022-10-16 10:49:45,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:49:45,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:45,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:45,379 INFO L229 MonitoredProcess]: Starting monitored process 28 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:49:45,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-10-16 10:49:45,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:49:45,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:45,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:49:45,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-16 10:49:45,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-16 10:49:45,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600264999] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:45,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:45,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:49:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784281178] [2022-10-16 10:49:45,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:45,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:49:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:45,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:49:45,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:49:45,668 INFO L87 Difference]: Start difference. First operand 356 states and 427 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:49:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:45,954 INFO L93 Difference]: Finished difference Result 374 states and 447 transitions. [2022-10-16 10:49:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:49:45,955 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 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:49:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:45,957 INFO L225 Difference]: With dead ends: 374 [2022-10-16 10:49:45,957 INFO L226 Difference]: Without dead ends: 373 [2022-10-16 10:49:45,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 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:49:45,958 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 118 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:45,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 132 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:49:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-10-16 10:49:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 355. [2022-10-16 10:49:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 348 states have (on average 1.2155172413793103) internal successors, (423), 354 states have internal predecessors, (423), 0 states have call successors, (0), 0 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:49:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 423 transitions. [2022-10-16 10:49:45,994 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 423 transitions. Word has length 61 [2022-10-16 10:49:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:45,995 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 423 transitions. [2022-10-16 10:49:45,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 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:49:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 423 transitions. [2022-10-16 10:49:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-16 10:49:45,996 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:45,996 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:46,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:46,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:46,210 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:46,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1574972464, now seen corresponding path program 7 times [2022-10-16 10:49:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:46,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888039764] [2022-10-16 10:49:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:46,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:46,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:49:46,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682520521] [2022-10-16 10:49:46,237 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:49:46,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:46,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:46,239 INFO L229 MonitoredProcess]: Starting monitored process 29 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:49:46,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-10-16 10:49:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:46,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 14 conjunts are in the unsatisfiable core [2022-10-16 10:49:46,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-16 10:49:46,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-16 10:49:46,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888039764] [2022-10-16 10:49:46,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682520521] [2022-10-16 10:49:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682520521] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:46,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:46,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2022-10-16 10:49:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796327515] [2022-10-16 10:49:46,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:46,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-16 10:49:46,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:46,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-16 10:49:46,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-10-16 10:49:46,681 INFO L87 Difference]: Start difference. First operand 355 states and 423 transitions. Second operand has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:49:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:47,192 INFO L93 Difference]: Finished difference Result 446 states and 534 transitions. [2022-10-16 10:49:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:49:47,195 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 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:49:47,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:47,197 INFO L225 Difference]: With dead ends: 446 [2022-10-16 10:49:47,197 INFO L226 Difference]: Without dead ends: 323 [2022-10-16 10:49:47,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=1133, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:49:47,198 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 155 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:47,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 189 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:49:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-10-16 10:49:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2022-10-16 10:49:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 314 states have (on average 1.21656050955414) internal successors, (382), 320 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:49:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 382 transitions. [2022-10-16 10:49:47,228 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 382 transitions. Word has length 63 [2022-10-16 10:49:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:47,228 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 382 transitions. [2022-10-16 10:49:47,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.217391304347826) internal successors, (74), 23 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:49:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 382 transitions. [2022-10-16 10:49:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 10:49:47,230 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:47,231 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:47,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:47,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:47,445 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:47,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:47,446 INFO L85 PathProgramCache]: Analyzing trace with hash 482497147, now seen corresponding path program 9 times [2022-10-16 10:49:47,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:47,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727355136] [2022-10-16 10:49:47,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:47,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 51 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:48,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:48,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727355136] [2022-10-16 10:49:48,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727355136] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:48,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625910590] [2022-10-16 10:49:48,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:49:48,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:48,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:48,030 INFO L229 MonitoredProcess]: Starting monitored process 30 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:49:48,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-10-16 10:49:48,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 10:49:48,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:48,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 10:49:48,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 80 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:48,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 80 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:49,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625910590] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:49,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:49,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2022-10-16 10:49:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275987644] [2022-10-16 10:49:49,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:49,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:49:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:49:49,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2022-10-16 10:49:49,097 INFO L87 Difference]: Start difference. First operand 321 states and 382 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 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:49:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:50,125 INFO L93 Difference]: Finished difference Result 508 states and 604 transitions. [2022-10-16 10:49:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-16 10:49:50,126 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 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) Word has length 65 [2022-10-16 10:49:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:50,131 INFO L225 Difference]: With dead ends: 508 [2022-10-16 10:49:50,132 INFO L226 Difference]: Without dead ends: 423 [2022-10-16 10:49:50,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 94 SyntacticMatches, 21 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=702, Invalid=3854, Unknown=0, NotChecked=0, Total=4556 [2022-10-16 10:49:50,134 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 288 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:50,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 326 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:49:50,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-10-16 10:49:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 358. [2022-10-16 10:49:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 351 states have (on average 1.1965811965811965) internal successors, (420), 357 states have internal predecessors, (420), 0 states have call successors, (0), 0 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:49:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 420 transitions. [2022-10-16 10:49:50,173 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 420 transitions. Word has length 65 [2022-10-16 10:49:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:50,174 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 420 transitions. [2022-10-16 10:49:50,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 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:49:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 420 transitions. [2022-10-16 10:49:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-16 10:49:50,175 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:50,175 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:50,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:50,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:50,390 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:50,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1153339649, now seen corresponding path program 10 times [2022-10-16 10:49:50,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:50,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952481320] [2022-10-16 10:49:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:51,959 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:49:51,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:51,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952481320] [2022-10-16 10:49:51,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952481320] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:51,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212793843] [2022-10-16 10:49:51,960 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:49:51,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:51,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:51,966 INFO L229 MonitoredProcess]: Starting monitored process 31 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:49:51,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-10-16 10:49:52,094 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:49:52,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:52,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-16 10:49:52,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:52,164 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:49:52,236 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:52,236 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 25 treesize of output 24 [2022-10-16 10:49:52,303 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:52,303 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 25 treesize of output 24 [2022-10-16 10:49:52,410 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:52,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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:49:52,515 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:52,515 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 25 treesize of output 24 [2022-10-16 10:49:52,626 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:52,627 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 25 treesize of output 24 [2022-10-16 10:49:52,766 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:49:52,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:52,943 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 16 treesize of output 14 [2022-10-16 10:49:52,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:49:53,009 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:49:53,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212793843] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:53,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:53,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 38 [2022-10-16 10:49:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676436835] [2022-10-16 10:49:53,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:53,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-16 10:49:53,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:53,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-16 10:49:53,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:49:53,015 INFO L87 Difference]: Start difference. First operand 358 states and 420 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 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:49:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:54,927 INFO L93 Difference]: Finished difference Result 516 states and 624 transitions. [2022-10-16 10:49:54,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:49:54,927 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 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) Word has length 69 [2022-10-16 10:49:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:54,929 INFO L225 Difference]: With dead ends: 516 [2022-10-16 10:49:54,930 INFO L226 Difference]: Without dead ends: 399 [2022-10-16 10:49:54,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2022-10-16 10:49:54,932 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 103 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 2649 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:54,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1132 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2649 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-10-16 10:49:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-10-16 10:49:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 372. [2022-10-16 10:49:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 365 states have (on average 1.1945205479452055) internal successors, (436), 371 states have internal predecessors, (436), 0 states have call successors, (0), 0 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:49:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 436 transitions. [2022-10-16 10:49:54,977 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 436 transitions. Word has length 69 [2022-10-16 10:49:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:54,978 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 436 transitions. [2022-10-16 10:49:54,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 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:49:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 436 transitions. [2022-10-16 10:49:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 10:49:54,979 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:54,979 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:55,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:55,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-10-16 10:49:55,194 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:55,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1198011565, now seen corresponding path program 8 times [2022-10-16 10:49:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:55,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043999008] [2022-10-16 10:49:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:55,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:49:55,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542133723] [2022-10-16 10:49:55,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:49:55,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:55,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:55,218 INFO L229 MonitoredProcess]: Starting monitored process 32 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:49:55,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-10-16 10:49:55,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:49:55,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:55,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 47 conjunts are in the unsatisfiable core [2022-10-16 10:49:55,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:55,353 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:49:55,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 37 treesize of output 17 [2022-10-16 10:49:55,598 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:55,599 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:49:55,683 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:49:55,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:49:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:49:55,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:55,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |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:49:55,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:49:55,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |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:49:55,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:49:56,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (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_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:49:56,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (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_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)))) is different from false [2022-10-16 10:49:56,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:49:58,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= 3 (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|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:49:58,190 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:49:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:49:58,198 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:58,198 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 38 treesize of output 34 [2022-10-16 10:49:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 46 not checked. [2022-10-16 10:49:58,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:58,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043999008] [2022-10-16 10:49:58,282 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:58,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542133723] [2022-10-16 10:49:58,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542133723] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:58,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:58,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 34 [2022-10-16 10:49:58,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794851120] [2022-10-16 10:49:58,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:58,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:49:58,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:58,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:49:58,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=571, Unknown=8, NotChecked=440, Total=1122 [2022-10-16 10:49:58,284 INFO L87 Difference]: Start difference. First operand 372 states and 436 transitions. Second operand has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:59,146 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |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|)) (= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))))) is different from false [2022-10-16 10:50:01,150 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |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|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3)))) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|) (= (select .cse0 .cse1) 3))) is different from false [2022-10-16 10:50:01,926 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3)) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select .cse0 .cse2) 3))) is different from false [2022-10-16 10:50:02,563 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ 8 |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|)) (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 3)) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (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_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 3) (< |v_ULTIMATE.start_main_~i~0#1_229| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select .cse1 .cse0) 3))) is different from false [2022-10-16 10:50:04,569 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |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|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)) (forall ((v_ArrVal_1286 Int) (v_ArrVal_1289 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_229| 4)) v_ArrVal_1286)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3)))) (forall ((v_ArrVal_1289 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3)) (= (select .cse0 .cse1) 3))) is different from false [2022-10-16 10:50:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:05,112 INFO L93 Difference]: Finished difference Result 513 states and 607 transitions. [2022-10-16 10:50:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-16 10:50:05,113 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-10-16 10:50:05,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:05,114 INFO L225 Difference]: With dead ends: 513 [2022-10-16 10:50:05,114 INFO L226 Difference]: Without dead ends: 462 [2022-10-16 10:50:05,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 106 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=170, Invalid=991, Unknown=13, NotChecked=988, Total=2162 [2022-10-16 10:50:05,116 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 118 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 673 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:05,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 447 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 737 Invalid, 0 Unknown, 673 Unchecked, 0.4s Time] [2022-10-16 10:50:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-10-16 10:50:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 406. [2022-10-16 10:50:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 399 states have (on average 1.1854636591478698) internal successors, (473), 405 states have internal predecessors, (473), 0 states have call successors, (0), 0 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:50:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 473 transitions. [2022-10-16 10:50:05,156 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 473 transitions. Word has length 70 [2022-10-16 10:50:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:05,157 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 473 transitions. [2022-10-16 10:50:05,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 473 transitions. [2022-10-16 10:50:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-16 10:50:05,158 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:05,158 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:05,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-10-16 10:50:05,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-10-16 10:50:05,372 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:50:05,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1968023236, now seen corresponding path program 9 times [2022-10-16 10:50:05,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:05,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453536080] [2022-10-16 10:50:05,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:05,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:05,394 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:50:05,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616812209] [2022-10-16 10:50:05,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:50:05,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:05,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:05,395 INFO L229 MonitoredProcess]: Starting monitored process 33 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:50:05,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-10-16 10:50:05,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 10:50:05,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:05,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 72 conjunts are in the unsatisfiable core [2022-10-16 10:50:05,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:05,639 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:50:05,991 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 37 treesize of output 17 [2022-10-16 10:50:06,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-10-16 10:50:06,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-10-16 10:50:06,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-10-16 10:50:07,099 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 19 treesize of output 21 [2022-10-16 10:50:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 32 proven. 89 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:50:07,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:07,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1358) |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:50:07,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1358) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)) is different from false [2022-10-16 10:50:09,415 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:09,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 70 [2022-10-16 10:50:09,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:09,426 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 38 treesize of output 34 [2022-10-16 10:50:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-10-16 10:50:09,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:09,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453536080] [2022-10-16 10:50:09,919 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:50:09,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616812209] [2022-10-16 10:50:09,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616812209] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:09,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:50:09,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 57 [2022-10-16 10:50:09,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167612237] [2022-10-16 10:50:09,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:09,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-16 10:50:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:09,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-16 10:50:09,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2759, Unknown=2, NotChecked=214, Total=3192 [2022-10-16 10:50:09,923 INFO L87 Difference]: Start difference. First operand 406 states and 473 transitions. Second operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 57 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:17,075 INFO L93 Difference]: Finished difference Result 461 states and 540 transitions. [2022-10-16 10:50:17,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-10-16 10:50:17,077 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 57 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-10-16 10:50:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:17,079 INFO L225 Difference]: With dead ends: 461 [2022-10-16 10:50:17,079 INFO L226 Difference]: Without dead ends: 426 [2022-10-16 10:50:17,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1903 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=880, Invalid=7863, Unknown=7, NotChecked=370, Total=9120 [2022-10-16 10:50:17,081 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 181 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 2359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1637 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:17,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 594 Invalid, 2359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 693 Invalid, 0 Unknown, 1637 Unchecked, 0.4s Time] [2022-10-16 10:50:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-10-16 10:50:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 399. [2022-10-16 10:50:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 392 states have (on average 1.1887755102040816) internal successors, (466), 398 states have internal predecessors, (466), 0 states have call successors, (0), 0 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:50:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 466 transitions. [2022-10-16 10:50:17,123 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 466 transitions. Word has length 74 [2022-10-16 10:50:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:17,124 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 466 transitions. [2022-10-16 10:50:17,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 57 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 466 transitions. [2022-10-16 10:50:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 10:50:17,125 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:17,125 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:17,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-10-16 10:50:17,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-10-16 10:50:17,339 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:50:17,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash 445652671, now seen corresponding path program 11 times [2022-10-16 10:50:17,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:17,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314429256] [2022-10-16 10:50:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 81 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:50:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:18,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314429256] [2022-10-16 10:50:18,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314429256] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:18,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125183275] [2022-10-16 10:50:18,209 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:50:18,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:18,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:18,210 INFO L229 MonitoredProcess]: Starting monitored process 34 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:50:18,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-10-16 10:50:18,420 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-10-16 10:50:18,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:18,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2022-10-16 10:50:18,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:19,105 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:50:19,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:19,895 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:50:19,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125183275] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:19,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:19,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2022-10-16 10:50:19,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088782895] [2022-10-16 10:50:19,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:19,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-16 10:50:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-16 10:50:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1784, Unknown=0, NotChecked=0, Total=2070 [2022-10-16 10:50:19,898 INFO L87 Difference]: Start difference. First operand 399 states and 466 transitions. Second operand has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:50:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:22,162 INFO L93 Difference]: Finished difference Result 618 states and 722 transitions. [2022-10-16 10:50:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-10-16 10:50:22,163 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 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 76 [2022-10-16 10:50:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:22,166 INFO L225 Difference]: With dead ends: 618 [2022-10-16 10:50:22,166 INFO L226 Difference]: Without dead ends: 533 [2022-10-16 10:50:22,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 110 SyntacticMatches, 25 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3154 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1265, Invalid=7107, Unknown=0, NotChecked=0, Total=8372 [2022-10-16 10:50:22,169 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 389 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:22,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 464 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-16 10:50:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-10-16 10:50:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 443. [2022-10-16 10:50:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 436 states have (on average 1.1743119266055047) internal successors, (512), 442 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:50:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 512 transitions. [2022-10-16 10:50:22,216 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 512 transitions. Word has length 76 [2022-10-16 10:50:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:22,217 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 512 transitions. [2022-10-16 10:50:22,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 0 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:50:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 512 transitions. [2022-10-16 10:50:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 10:50:22,218 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:22,218 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:22,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-10-16 10:50:22,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-10-16 10:50:22,434 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:50:22,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash 952699344, now seen corresponding path program 10 times [2022-10-16 10:50:22,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:22,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039660780] [2022-10-16 10:50:22,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:22,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:22,456 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:50:22,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1693239879] [2022-10-16 10:50:22,457 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:50:22,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:22,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:22,458 INFO L229 MonitoredProcess]: Starting monitored process 35 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:50:22,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-10-16 10:50:22,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:50:22,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:22,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 46 conjunts are in the unsatisfiable core [2022-10-16 10:50:22,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:23,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:50:23,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:50:23,208 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:50:23,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:50:23,373 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:50:23,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:50:23,577 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:50:23,691 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 19 treesize of output 7 [2022-10-16 10:50:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:50:23,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:23,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |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)) 3)) is different from false [2022-10-16 10:50:23,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:50:23,887 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |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:50:23,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:50:23,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |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|)) 3)) is different from false [2022-10-16 10:50:23,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:50:23,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1483 (Array Int Int))) (= (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|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 2))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:50:24,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:24,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-10-16 10:50:24,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:24,059 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 38 treesize of output 34 [2022-10-16 10:50:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 46 not checked. [2022-10-16 10:50:24,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:24,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039660780] [2022-10-16 10:50:24,488 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:50:24,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693239879] [2022-10-16 10:50:24,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693239879] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:24,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:50:24,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2022-10-16 10:50:24,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948303503] [2022-10-16 10:50:24,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:24,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-10-16 10:50:24,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-10-16 10:50:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=994, Unknown=7, NotChecked=490, Total=1640 [2022-10-16 10:50:24,490 INFO L87 Difference]: Start difference. First operand 443 states and 512 transitions. Second operand has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 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:50:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:26,202 INFO L93 Difference]: Finished difference Result 565 states and 651 transitions. [2022-10-16 10:50:26,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 10:50:26,204 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 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) Word has length 77 [2022-10-16 10:50:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:26,207 INFO L225 Difference]: With dead ends: 565 [2022-10-16 10:50:26,207 INFO L226 Difference]: Without dead ends: 532 [2022-10-16 10:50:26,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 114 SyntacticMatches, 10 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=226, Invalid=1517, Unknown=7, NotChecked=602, Total=2352 [2022-10-16 10:50:26,208 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 264 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 762 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:26,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 767 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1549 Invalid, 0 Unknown, 762 Unchecked, 0.9s Time] [2022-10-16 10:50:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2022-10-16 10:50:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 488. [2022-10-16 10:50:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 481 states have (on average 1.162162162162162) internal successors, (559), 487 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:50:26,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 559 transitions. [2022-10-16 10:50:26,253 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 559 transitions. Word has length 77 [2022-10-16 10:50:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:26,253 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 559 transitions. [2022-10-16 10:50:26,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 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:50:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 559 transitions. [2022-10-16 10:50:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 10:50:26,255 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:26,255 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:26,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-10-16 10:50:26,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:26,471 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:50:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:26,472 INFO L85 PathProgramCache]: Analyzing trace with hash 952699152, now seen corresponding path program 2 times [2022-10-16 10:50:26,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:26,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389809769] [2022-10-16 10:50:26,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:26,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-16 10:50:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:27,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389809769] [2022-10-16 10:50:27,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389809769] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:27,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226862549] [2022-10-16 10:50:27,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:50:27,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:27,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:27,360 INFO L229 MonitoredProcess]: Starting monitored process 36 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:50:27,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-10-16 10:50:27,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:50:27,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:27,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-16 10:50:27,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:27,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:50:27,511 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:50:27,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:50:27,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:50:27,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:50:27,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:50:27,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:50:27,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 14 treesize of output 16 [2022-10-16 10:50:27,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:50:27,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:50:27,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-10-16 10:50:28,123 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:50:28,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2022-10-16 10:50:28,441 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-10-16 10:50:28,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 61 [2022-10-16 10:50:28,732 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:28,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 98 [2022-10-16 10:50:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-10-16 10:50:28,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:45,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_289| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_285| Int) (v_ArrVal_1553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_287| Int) (v_ArrVal_1556 Int) (v_ArrVal_1555 Int) (v_ArrVal_1558 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1553))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1556)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_287| 4)))) (.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_285| 4)))) (.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1555)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_289| 4)))) (.cse3 (select v_ArrVal_1553 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (< 3 .cse0) (< (+ v_ArrVal_1558 .cse1) 9223372036854775808) (< 3 .cse2) (< (+ .cse0 v_ArrVal_1556) v_ArrVal_1558) (< 3 .cse1) (< (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1555) (< (+ .cse2 v_ArrVal_1555) v_ArrVal_1556) (< 3 .cse3)))))) is different from false [2022-10-16 10:50:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 13 not checked. [2022-10-16 10:50:50,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226862549] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:50,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:50,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2022-10-16 10:50:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413207977] [2022-10-16 10:50:50,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:50,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:50:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:50,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:50:50,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1178, Unknown=8, NotChecked=74, Total=1560 [2022-10-16 10:50:50,193 INFO L87 Difference]: Start difference. First operand 488 states and 559 transitions. Second operand has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:51:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:01,179 INFO L93 Difference]: Finished difference Result 578 states and 679 transitions. [2022-10-16 10:51:01,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:51:01,180 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 0 states have call successors, (0), 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 77 [2022-10-16 10:51:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:01,183 INFO L225 Difference]: With dead ends: 578 [2022-10-16 10:51:01,183 INFO L226 Difference]: Without dead ends: 577 [2022-10-16 10:51:01,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=671, Invalid=2517, Unknown=8, NotChecked=110, Total=3306 [2022-10-16 10:51:01,185 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 80 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:01,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 336 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 187 Unchecked, 0.1s Time] [2022-10-16 10:51:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2022-10-16 10:51:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 540. [2022-10-16 10:51:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 533 states have (on average 1.176360225140713) internal successors, (627), 539 states have internal predecessors, (627), 0 states have call successors, (0), 0 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:51:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 627 transitions. [2022-10-16 10:51:01,251 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 627 transitions. Word has length 77 [2022-10-16 10:51:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:01,252 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 627 transitions. [2022-10-16 10:51:01,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 0 states have call successors, (0), 0 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:51:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 627 transitions. [2022-10-16 10:51:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-16 10:51:01,254 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:01,254 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:01,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:01,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-10-16 10:51:01,455 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash -917434056, now seen corresponding path program 11 times [2022-10-16 10:51:01,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:01,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390136044] [2022-10-16 10:51:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:01,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:01,476 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:01,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506534496] [2022-10-16 10:51:01,477 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:51:01,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:01,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:01,478 INFO L229 MonitoredProcess]: Starting monitored process 37 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:51:01,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-10-16 10:51:01,694 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-10-16 10:51:01,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:01,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 10:51:01,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 45 proven. 96 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:51:02,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 45 proven. 96 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:51:02,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:02,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390136044] [2022-10-16 10:51:02,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:02,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506534496] [2022-10-16 10:51:02,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506534496] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:02,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:02,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 36 [2022-10-16 10:51:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504672493] [2022-10-16 10:51:02,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:02,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-10-16 10:51:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-10-16 10:51:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2022-10-16 10:51:02,700 INFO L87 Difference]: Start difference. First operand 540 states and 627 transitions. Second operand has 36 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 36 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:51:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:03,735 INFO L93 Difference]: Finished difference Result 756 states and 894 transitions. [2022-10-16 10:51:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-16 10:51:03,736 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 36 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-10-16 10:51:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:03,741 INFO L225 Difference]: With dead ends: 756 [2022-10-16 10:51:03,741 INFO L226 Difference]: Without dead ends: 547 [2022-10-16 10:51:03,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 108 SyntacticMatches, 12 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=486, Invalid=2594, Unknown=0, NotChecked=0, Total=3080 [2022-10-16 10:51:03,745 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 217 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:03,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 449 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 10:51:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-10-16 10:51:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 489. [2022-10-16 10:51:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 482 states have (on average 1.1721991701244814) internal successors, (565), 488 states have internal predecessors, (565), 0 states have call successors, (0), 0 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:51:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 565 transitions. [2022-10-16 10:51:03,799 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 565 transitions. Word has length 78 [2022-10-16 10:51:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:03,800 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 565 transitions. [2022-10-16 10:51:03,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.1666666666666665) internal successors, (114), 36 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:51:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 565 transitions. [2022-10-16 10:51:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-16 10:51:03,802 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:03,802 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:03,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-10-16 10:51:04,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:04,017 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:04,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:04,018 INFO L85 PathProgramCache]: Analyzing trace with hash 744540091, now seen corresponding path program 12 times [2022-10-16 10:51:04,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:04,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669616858] [2022-10-16 10:51:04,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:04,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:05,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669616858] [2022-10-16 10:51:05,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669616858] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:05,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633895906] [2022-10-16 10:51:05,965 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:51:05,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:05,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:05,970 INFO L229 MonitoredProcess]: Starting monitored process 38 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:51:05,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-10-16 10:51:06,430 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-10-16 10:51:06,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:06,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 73 conjunts are in the unsatisfiable core [2022-10-16 10:51:06,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:06,518 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:51:06,592 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:06,592 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 25 treesize of output 24 [2022-10-16 10:51:06,677 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:06,677 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 25 treesize of output 24 [2022-10-16 10:51:06,813 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:06,813 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 25 treesize of output 24 [2022-10-16 10:51:06,959 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:06,959 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 25 treesize of output 24 [2022-10-16 10:51:07,099 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:07,100 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 25 treesize of output 24 [2022-10-16 10:51:07,246 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:07,246 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 25 treesize of output 24 [2022-10-16 10:51:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:07,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:07,629 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 16 treesize of output 14 [2022-10-16 10:51:07,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:51:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:07,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633895906] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:07,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:07,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 44 [2022-10-16 10:51:07,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427467708] [2022-10-16 10:51:07,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:07,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-16 10:51:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:07,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-16 10:51:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1769, Unknown=0, NotChecked=0, Total=1892 [2022-10-16 10:51:07,728 INFO L87 Difference]: Start difference. First operand 489 states and 565 transitions. Second operand has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 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:51:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:10,243 INFO L93 Difference]: Finished difference Result 724 states and 867 transitions. [2022-10-16 10:51:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:51:10,243 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 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 80 [2022-10-16 10:51:10,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:10,245 INFO L225 Difference]: With dead ends: 724 [2022-10-16 10:51:10,245 INFO L226 Difference]: Without dead ends: 525 [2022-10-16 10:51:10,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 148 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=237, Invalid=3669, Unknown=0, NotChecked=0, Total=3906 [2022-10-16 10:51:10,246 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 134 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 3123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:10,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1206 Invalid, 3123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-10-16 10:51:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-10-16 10:51:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 503. [2022-10-16 10:51:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 496 states have (on average 1.1713709677419355) internal successors, (581), 502 states have internal predecessors, (581), 0 states have call successors, (0), 0 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:51:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 581 transitions. [2022-10-16 10:51:10,301 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 581 transitions. Word has length 80 [2022-10-16 10:51:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:10,302 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 581 transitions. [2022-10-16 10:51:10,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.909090909090909) internal successors, (128), 44 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:51:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 581 transitions. [2022-10-16 10:51:10,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-16 10:51:10,303 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:10,303 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:10,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:10,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:10,504 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:10,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1987594419, now seen corresponding path program 12 times [2022-10-16 10:51:10,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:10,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854105174] [2022-10-16 10:51:10,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:10,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:10,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:10,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969737337] [2022-10-16 10:51:10,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:51:10,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:10,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:10,527 INFO L229 MonitoredProcess]: Starting monitored process 39 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:51:10,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-10-16 10:51:10,886 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-10-16 10:51:10,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:10,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 10:51:10,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 50 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:51:11,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 50 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:51:11,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:11,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854105174] [2022-10-16 10:51:11,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:11,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969737337] [2022-10-16 10:51:11,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969737337] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:11,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:11,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2022-10-16 10:51:11,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026642048] [2022-10-16 10:51:11,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:11,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-16 10:51:11,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:11,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-16 10:51:11,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2022-10-16 10:51:11,831 INFO L87 Difference]: Start difference. First operand 503 states and 581 transitions. Second operand has 30 states, 30 states have (on average 3.4) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:51:12,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:12,479 INFO L93 Difference]: Finished difference Result 540 states and 622 transitions. [2022-10-16 10:51:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-16 10:51:12,481 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.4) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 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 84 [2022-10-16 10:51:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:12,482 INFO L225 Difference]: With dead ends: 540 [2022-10-16 10:51:12,482 INFO L226 Difference]: Without dead ends: 451 [2022-10-16 10:51:12,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 128 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2022-10-16 10:51:12,483 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 168 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:12,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 323 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:51:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-10-16 10:51:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2022-10-16 10:51:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 442 states have (on average 1.1877828054298643) internal successors, (525), 448 states have internal predecessors, (525), 0 states have call successors, (0), 0 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:51:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 525 transitions. [2022-10-16 10:51:12,524 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 525 transitions. Word has length 84 [2022-10-16 10:51:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:12,525 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 525 transitions. [2022-10-16 10:51:12,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.4) internal successors, (102), 30 states have internal predecessors, (102), 0 states have call successors, (0), 0 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:51:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 525 transitions. [2022-10-16 10:51:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-10-16 10:51:12,526 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:12,526 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:12,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:12,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-10-16 10:51:12,739 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 757864824, now seen corresponding path program 13 times [2022-10-16 10:51:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:12,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130012418] [2022-10-16 10:51:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:12,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:12,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928284706] [2022-10-16 10:51:12,762 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:51:12,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:12,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:12,763 INFO L229 MonitoredProcess]: Starting monitored process 40 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:51:12,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-10-16 10:51:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:12,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 48 conjunts are in the unsatisfiable core [2022-10-16 10:51:12,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:12,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:51:13,078 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 37 treesize of output 17 [2022-10-16 10:51:13,198 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:13,198 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:51:13,299 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:13,300 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:51:13,406 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:13,407 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:51:13,516 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:13,517 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:51:13,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:51:13,688 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 19 treesize of output 7 [2022-10-16 10:51:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 39 proven. 74 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-10-16 10:51:13,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:13,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |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)) 3)) is different from false [2022-10-16 10:51:13,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:51:13,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= 3 (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_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:51:13,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_344|)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (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_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3)))) is different from false [2022-10-16 10:51:13,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (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|) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:51:13,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (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_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:51:14,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_345|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 3 (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_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))))) is different from false [2022-10-16 10:51:14,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 3 (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_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) is different from false [2022-10-16 10:51:14,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (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_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) is different from false [2022-10-16 10:51:14,215 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) is different from false [2022-10-16 10:51:14,290 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) is different from false [2022-10-16 10:51:14,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (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_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) is different from false [2022-10-16 10:51:14,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (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_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_347|)))) is different from false [2022-10-16 10:51:14,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (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_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3))) is different from false [2022-10-16 10:51:14,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (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|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_347| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) is different from false [2022-10-16 10:51:14,977 INFO L356 Elim1Store]: treesize reduction 364, result has 14.8 percent of original size [2022-10-16 10:51:14,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 79 [2022-10-16 10:51:14,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:14,989 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 38 treesize of output 34 [2022-10-16 10:51:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 111 not checked. [2022-10-16 10:51:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:15,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130012418] [2022-10-16 10:51:15,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:15,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928284706] [2022-10-16 10:51:15,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928284706] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:15,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:15,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 42 [2022-10-16 10:51:15,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489501791] [2022-10-16 10:51:15,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:15,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-16 10:51:15,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:15,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-16 10:51:15,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=611, Unknown=15, NotChecked=960, Total=1722 [2022-10-16 10:51:15,071 INFO L87 Difference]: Start difference. First operand 449 states and 525 transitions. Second operand has 42 states, 42 states have (on average 2.619047619047619) internal successors, (110), 42 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:51:16,383 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 3))) (= 3 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |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| 1))) is different from false [2022-10-16 10:51:18,390 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 3) (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_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_347|)))) (<= 1 |c_ULTIMATE.start_main_#t~post7#1|))) is different from false [2022-10-16 10:51:20,403 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) is different from false [2022-10-16 10:51:22,412 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (= (select .cse0 .cse1) 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:51:24,417 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_346| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))))) is different from false [2022-10-16 10:51:26,486 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 .cse1) 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (store .cse0 .cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_347| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| .cse3) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse2 v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))))) is different from false [2022-10-16 10:51:28,501 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3))) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse1 .cse2) 3) (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_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 3 (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_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_345| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))))) is different from false [2022-10-16 10:51:30,510 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 3 |c_ULTIMATE.start_main_#t~post7#1|) (= (select .cse0 .cse1) 3) (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_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_347|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_345|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 3 (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_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))))))) is different from false [2022-10-16 10:51:32,518 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 .cse1) 3) (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_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse2 v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3) (< |v_ULTIMATE.start_main_~i~0#1_344| .cse3))) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse2 v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_346| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:51:34,527 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_346| .cse0) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (= (select .cse1 .cse2) 3) (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_344| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3) (< |v_ULTIMATE.start_main_~i~0#1_344| .cse0))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:51:36,533 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_344|)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3)))) (= (select .cse1 .cse2) 3) (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_346| Int)) (or (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_346|)) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))))) is different from false [2022-10-16 10:51:38,642 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 3) (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|) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (store .cse0 .cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_347| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)))) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_345| .cse3) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse2 v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-10-16 10:51:40,681 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_347| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_347| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3))) (= (select .cse1 .cse2) 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 3 (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_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_345| .cse0) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))) (forall ((v_ArrVal_1842 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) is different from false [2022-10-16 10:51:42,702 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (= (select .cse0 .cse1) 3) (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_347| Int)) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)) (< |v_ULTIMATE.start_main_~i~0#1_346| (+ |v_ULTIMATE.start_main_~i~0#1_347| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_347| 4)) v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_347|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_345| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_345|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= 3 (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_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)))))) (forall ((v_ArrVal_1842 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-10-16 10:51:44,754 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (= (select .cse0 .cse1) 3) (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|) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse2 v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3) (< |v_ULTIMATE.start_main_~i~0#1_344| .cse3))) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse2 v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_346| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))) (forall ((v_ArrVal_1842 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-10-16 10:51:46,820 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select .cse0 .cse1) 3) (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|) (forall ((|v_ULTIMATE.start_main_~i~0#1_344| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse2 v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3) (< |v_ULTIMATE.start_main_~i~0#1_344| .cse3))) (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~i~0#1_345| Int) (|v_ULTIMATE.start_main_~i~0#1_344| Int) (|v_ULTIMATE.start_main_~i~0#1_346| Int) (v_ArrVal_1838 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1840 Int) (v_ArrVal_1835 Int)) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse2 v_ArrVal_1835) (+ (* |v_ULTIMATE.start_main_~i~0#1_346| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1837) (+ (* |v_ULTIMATE.start_main_~i~0#1_345| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1838) (+ (* |v_ULTIMATE.start_main_~i~0#1_344| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1840)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_346| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_344| (+ |v_ULTIMATE.start_main_~i~0#1_345| 1)) (< |v_ULTIMATE.start_main_~i~0#1_345| (+ |v_ULTIMATE.start_main_~i~0#1_346| 1)))))) is different from false [2022-10-16 10:51:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:46,975 INFO L93 Difference]: Finished difference Result 754 states and 924 transitions. [2022-10-16 10:51:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:51:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.619047619047619) internal successors, (110), 42 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) Word has length 85 [2022-10-16 10:51:46,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:46,978 INFO L225 Difference]: With dead ends: 754 [2022-10-16 10:51:46,978 INFO L226 Difference]: Without dead ends: 685 [2022-10-16 10:51:46,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 131 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=205, Invalid=818, Unknown=31, NotChecked=2728, Total=3782 [2022-10-16 10:51:46,979 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 129 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1070 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:46,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 395 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 514 Invalid, 0 Unknown, 1070 Unchecked, 0.4s Time] [2022-10-16 10:51:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-10-16 10:51:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 529. [2022-10-16 10:51:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 522 states have (on average 1.2011494252873562) internal successors, (627), 528 states have internal predecessors, (627), 0 states have call successors, (0), 0 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:51:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 627 transitions. [2022-10-16 10:51:47,038 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 627 transitions. Word has length 85 [2022-10-16 10:51:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:47,038 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 627 transitions. [2022-10-16 10:51:47,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.619047619047619) internal successors, (110), 42 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:51:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 627 transitions. [2022-10-16 10:51:47,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 10:51:47,039 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:47,040 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:47,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-10-16 10:51:47,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-10-16 10:51:47,253 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:47,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1453671805, now seen corresponding path program 13 times [2022-10-16 10:51:47,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:47,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842868280] [2022-10-16 10:51:47,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:47,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 118 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:48,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:48,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842868280] [2022-10-16 10:51:48,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842868280] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:51:48,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992951592] [2022-10-16 10:51:48,694 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:51:48,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:48,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:48,696 INFO L229 MonitoredProcess]: Starting monitored process 41 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:51:48,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-10-16 10:51:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:51:48,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:51:48,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 161 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:50,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 161 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:51:51,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992951592] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:51,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:51:51,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 52 [2022-10-16 10:51:51,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174536230] [2022-10-16 10:51:51,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:51,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-10-16 10:51:51,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:51,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-10-16 10:51:51,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2295, Unknown=0, NotChecked=0, Total=2652 [2022-10-16 10:51:51,831 INFO L87 Difference]: Start difference. First operand 529 states and 627 transitions. Second operand has 52 states, 52 states have (on average 2.9038461538461537) internal successors, (151), 52 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:51:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:51:55,483 INFO L93 Difference]: Finished difference Result 806 states and 957 transitions. [2022-10-16 10:51:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-10-16 10:51:55,484 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.9038461538461537) internal successors, (151), 52 states have internal predecessors, (151), 0 states have call successors, (0), 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 87 [2022-10-16 10:51:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:51:55,487 INFO L225 Difference]: With dead ends: 806 [2022-10-16 10:51:55,487 INFO L226 Difference]: Without dead ends: 655 [2022-10-16 10:51:55,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 126 SyntacticMatches, 29 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4281 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1715, Invalid=9627, Unknown=0, NotChecked=0, Total=11342 [2022-10-16 10:51:55,492 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 422 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:51:55,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 445 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 10:51:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2022-10-16 10:51:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 573. [2022-10-16 10:51:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 566 states have (on average 1.187279151943463) internal successors, (672), 572 states have internal predecessors, (672), 0 states have call successors, (0), 0 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:51:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 672 transitions. [2022-10-16 10:51:55,565 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 672 transitions. Word has length 87 [2022-10-16 10:51:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:51:55,565 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 672 transitions. [2022-10-16 10:51:55,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.9038461538461537) internal successors, (151), 52 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:51:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 672 transitions. [2022-10-16 10:51:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-10-16 10:51:55,586 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:51:55,587 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:51:55,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-10-16 10:51:55,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-10-16 10:51:55,797 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:51:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:51:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1339241884, now seen corresponding path program 14 times [2022-10-16 10:51:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:51:55,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578691317] [2022-10-16 10:51:55,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:51:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:51:55,819 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:51:55,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [634362570] [2022-10-16 10:51:55,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:51:55,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:51:55,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:51:55,820 INFO L229 MonitoredProcess]: Starting monitored process 42 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:51:55,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-10-16 10:51:55,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:51:55,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:51:55,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 10:51:55,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:51:55,991 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:51:56,232 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 37 treesize of output 17 [2022-10-16 10:51:56,355 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:51:56,356 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:51:56,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:51:56,546 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:51:56,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 16 treesize of output 18 [2022-10-16 10:51:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:51:56,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:51:56,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |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)) 3)) is different from false [2022-10-16 10:51:56,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:51:56,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |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:51:56,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:51:56,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |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|)) 3)) is different from false [2022-10-16 10:51:56,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:51:56,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= 3 (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_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:51:57,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (or (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= 3 (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_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_378|)))) is different from false [2022-10-16 10:51:57,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 3 (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_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-10-16 10:51:59,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (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|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3))) is different from false [2022-10-16 10:51:59,250 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:51:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:51:59,259 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:51:59,259 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 38 treesize of output 34 [2022-10-16 10:51:59,384 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 45 trivial. 75 not checked. [2022-10-16 10:51:59,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:51:59,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578691317] [2022-10-16 10:51:59,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:51:59,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634362570] [2022-10-16 10:51:59,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634362570] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:51:59,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:51:59,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 40 [2022-10-16 10:51:59,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235279152] [2022-10-16 10:51:59,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:51:59,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:51:59,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:51:59,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:51:59,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=778, Unknown=10, NotChecked=650, Total=1560 [2022-10-16 10:51:59,388 INFO L87 Difference]: Start difference. First operand 573 states and 672 transitions. Second operand has 40 states, 40 states have (on average 2.775) internal successors, (111), 40 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:52:00,573 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |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|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (= 3 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:52:02,577 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 3 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (or (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_378|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 3 (select .cse0 .cse1)))) is different from false [2022-10-16 10:52:03,438 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ 12 |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|)) (= 3 (select .cse0 .cse1)) (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3))))) is different from false [2022-10-16 10:52:04,150 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 12 |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|)) (= 3 (select .cse0 .cse1)) (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3)) (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int) (v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_378| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-10-16 10:52:06,154 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_378| Int)) (or (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1983 Int)) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_378| 4)) v_ArrVal_1983)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_378|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 3 (select .cse0 .cse1)) (forall ((v_ArrVal_1986 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3)))) is different from false [2022-10-16 10:52:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:52:06,978 INFO L93 Difference]: Finished difference Result 707 states and 829 transitions. [2022-10-16 10:52:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-16 10:52:06,979 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 40 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-10-16 10:52:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:52:06,981 INFO L225 Difference]: With dead ends: 707 [2022-10-16 10:52:06,981 INFO L226 Difference]: Without dead ends: 674 [2022-10-16 10:52:06,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 136 SyntacticMatches, 11 SemanticMatches, 53 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=203, Invalid=1402, Unknown=15, NotChecked=1350, Total=2970 [2022-10-16 10:52:06,982 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 118 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 916 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 10:52:06,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 682 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1242 Invalid, 0 Unknown, 916 Unchecked, 0.7s Time] [2022-10-16 10:52:06,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-10-16 10:52:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 628. [2022-10-16 10:52:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 621 states have (on average 1.1771336553945249) internal successors, (731), 627 states have internal predecessors, (731), 0 states have call successors, (0), 0 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:52:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 731 transitions. [2022-10-16 10:52:07,043 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 731 transitions. Word has length 88 [2022-10-16 10:52:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:52:07,044 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 731 transitions. [2022-10-16 10:52:07,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 40 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:52:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 731 transitions. [2022-10-16 10:52:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-10-16 10:52:07,045 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:52:07,045 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:52:07,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-10-16 10:52:07,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-10-16 10:52:07,258 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:52:07,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:52:07,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2096094215, now seen corresponding path program 14 times [2022-10-16 10:52:07,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:52:07,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294805348] [2022-10-16 10:52:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:52:07,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:52:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:52:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:52:09,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:09,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294805348] [2022-10-16 10:52:09,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294805348] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:52:09,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745789132] [2022-10-16 10:52:09,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:52:09,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:09,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:52:09,627 INFO L229 MonitoredProcess]: Starting monitored process 43 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:52:09,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-10-16 10:52:09,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:52:09,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:52:09,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 83 conjunts are in the unsatisfiable core [2022-10-16 10:52:09,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:52:09,885 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:52:09,959 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:52:09,960 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 25 treesize of output 24 [2022-10-16 10:52:10,049 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:52:10,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 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:52:10,192 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:52:10,193 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 25 treesize of output 24 [2022-10-16 10:52:10,344 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:52:10,344 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 25 treesize of output 24 [2022-10-16 10:52:10,500 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:52:10,500 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 25 treesize of output 24 [2022-10-16 10:52:10,655 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:52:10,656 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 25 treesize of output 24 [2022-10-16 10:52:10,822 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:52:10,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, 0 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:52:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:52:11,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:52:11,262 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 16 treesize of output 14 [2022-10-16 10:52:11,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:52:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:52:11,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745789132] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:52:11,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:52:11,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 50 [2022-10-16 10:52:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99528006] [2022-10-16 10:52:11,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:52:11,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-10-16 10:52:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:52:11,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-10-16 10:52:11,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2310, Unknown=0, NotChecked=0, Total=2450 [2022-10-16 10:52:11,375 INFO L87 Difference]: Start difference. First operand 628 states and 731 transitions. Second operand has 50 states, 50 states have (on average 2.92) internal successors, (146), 50 states have internal predecessors, (146), 0 states have call successors, (0), 0 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:52:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:52:14,442 INFO L93 Difference]: Finished difference Result 934 states and 1122 transitions. [2022-10-16 10:52:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-16 10:52:14,443 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.92) internal successors, (146), 50 states have internal predecessors, (146), 0 states have call successors, (0), 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 91 [2022-10-16 10:52:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:52:14,445 INFO L225 Difference]: With dead ends: 934 [2022-10-16 10:52:14,445 INFO L226 Difference]: Without dead ends: 669 [2022-10-16 10:52:14,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=272, Invalid=4840, Unknown=0, NotChecked=0, Total=5112 [2022-10-16 10:52:14,446 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 148 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 3861 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:52:14,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1385 Invalid, 3910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3861 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-10-16 10:52:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-10-16 10:52:14,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 642. [2022-10-16 10:52:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 635 states have (on average 1.1763779527559055) internal successors, (747), 641 states have internal predecessors, (747), 0 states have call successors, (0), 0 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:52:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 747 transitions. [2022-10-16 10:52:14,516 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 747 transitions. Word has length 91 [2022-10-16 10:52:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:52:14,517 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 747 transitions. [2022-10-16 10:52:14,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.92) internal successors, (146), 50 states have internal predecessors, (146), 0 states have call successors, (0), 0 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:52:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 747 transitions. [2022-10-16 10:52:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-16 10:52:14,518 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:52:14,518 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:52:14,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-10-16 10:52:14,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:14,719 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:52:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:52:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash -852804955, now seen corresponding path program 15 times [2022-10-16 10:52:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:52:14,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137348297] [2022-10-16 10:52:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:52:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:52:14,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:52:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2093452293] [2022-10-16 10:52:14,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:52:14,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:14,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:52:14,749 INFO L229 MonitoredProcess]: Starting monitored process 44 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:52:14,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-10-16 10:52:15,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-10-16 10:52:15,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:52:15,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 51 conjunts are in the unsatisfiable core [2022-10-16 10:52:15,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:52:15,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:52:15,828 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:52:15,829 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 25 treesize of output 24 [2022-10-16 10:52:15,996 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:52:15,997 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 25 treesize of output 24 [2022-10-16 10:52:16,175 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:52:16,176 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 25 treesize of output 24 [2022-10-16 10:52:16,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:52:16,360 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:52:16,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:52:16,551 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:52:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 19 proven. 103 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-10-16 10:52:16,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:52:16,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |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)) 3)) is different from false [2022-10-16 10:52:16,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:52:16,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |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|)) 3)) is different from false [2022-10-16 10:52:16,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:52:16,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (= 3 (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_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:52:17,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_410|)) (forall ((v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (= (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_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)))) is different from false [2022-10-16 10:52:17,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (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_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3))) is different from false [2022-10-16 10:52:17,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= 3 (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_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:52:17,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int)) (or (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_411|)))) is different from false [2022-10-16 10:52:17,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (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_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:52:17,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (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_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:52:17,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_412| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_412|)))) is different from false [2022-10-16 10:52:17,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (< |v_ULTIMATE.start_main_~i~0#1_412| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) is different from false [2022-10-16 10:52:17,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (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|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (< |v_ULTIMATE.start_main_~i~0#1_412| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) is different from false [2022-10-16 10:52:17,566 INFO L356 Elim1Store]: treesize reduction 203, result has 20.1 percent of original size [2022-10-16 10:52:17,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 67 [2022-10-16 10:52:17,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:17,574 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 38 treesize of output 34 [2022-10-16 10:52:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 66 trivial. 111 not checked. [2022-10-16 10:52:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:17,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137348297] [2022-10-16 10:52:17,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:52:17,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093452293] [2022-10-16 10:52:17,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093452293] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:52:17,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:52:17,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 50 [2022-10-16 10:52:17,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340621677] [2022-10-16 10:52:17,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:52:17,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-10-16 10:52:17,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:52:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-10-16 10:52:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1117, Unknown=14, NotChecked=1134, Total=2450 [2022-10-16 10:52:17,924 INFO L87 Difference]: Start difference. First operand 642 states and 747 transitions. Second operand has 50 states, 50 states have (on average 2.78) internal successors, (139), 50 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:52:19,136 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (< |v_ULTIMATE.start_main_~i~0#1_412| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (= 2 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:52:21,143 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_412| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_412|)))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|) (= (select .cse0 .cse1) 3))) is different from false [2022-10-16 10:52:23,222 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3) (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (< |v_ULTIMATE.start_main_~i~0#1_412| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (= (select .cse0 .cse2) 3))) is different from false [2022-10-16 10:52:25,231 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (< |v_ULTIMATE.start_main_~i~0#1_412| .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| .cse0))) (= (select .cse1 .cse2) 3))) is different from false [2022-10-16 10:52:27,240 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 3 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_412| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_412|)))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int)) (or (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_411|)))) (= (select .cse0 .cse1) 3))) is different from false [2022-10-16 10:52:29,251 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 8 |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_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_410| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| .cse3))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 .cse2) 3))) is different from false [2022-10-16 10:52:31,263 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 8 |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_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_410| .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_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3))) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)) (< |v_ULTIMATE.start_main_~i~0#1_411| .cse0))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse1 .cse2) 3))) is different from false [2022-10-16 10:52:33,271 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int)) (or (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_411|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_410|)) (forall ((v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3)))) (= (select .cse0 .cse1) 3))) is different from false [2022-10-16 10:52:34,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ 8 |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|) (<= 5 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_2151 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_410| .cse3))) (forall ((v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (= 3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1| 2)) (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 3) (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (< |v_ULTIMATE.start_main_~i~0#1_412| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (= (select .cse0 .cse2) 3))) is different from false [2022-10-16 10:52:36,610 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_2156 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (|v_ULTIMATE.start_main_~i~0#1_412| Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (< |v_ULTIMATE.start_main_~i~0#1_412| .cse1) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_410| .cse1) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 3))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse2 .cse0) 3))) is different from false [2022-10-16 10:52:38,629 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (<= 4 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_412| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_411| Int) (v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (|v_ULTIMATE.start_main_~i~0#1_410| Int) (v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_411| (+ |v_ULTIMATE.start_main_~i~0#1_412| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_412| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_411| 4)) v_ArrVal_2151) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3) (< |v_ULTIMATE.start_main_~i~0#1_410| (+ |v_ULTIMATE.start_main_~i~0#1_411| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_412|)))) (forall ((v_ArrVal_2156 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_410| Int)) (or (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_410|)) (forall ((v_ArrVal_2153 Int) (v_ArrVal_2156 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_410| 4)) v_ArrVal_2153)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 3)))) (= (select .cse0 .cse1) 3))) is different from false [2022-10-16 10:52:39,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:52:39,167 INFO L93 Difference]: Finished difference Result 710 states and 823 transitions. [2022-10-16 10:52:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 10:52:39,168 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.78) internal successors, (139), 50 states have internal predecessors, (139), 0 states have call successors, (0), 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 92 [2022-10-16 10:52:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:52:39,170 INFO L225 Difference]: With dead ends: 710 [2022-10-16 10:52:39,170 INFO L226 Difference]: Without dead ends: 659 [2022-10-16 10:52:39,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 136 SyntacticMatches, 8 SemanticMatches, 65 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=268, Invalid=1529, Unknown=25, NotChecked=2600, Total=4422 [2022-10-16 10:52:39,171 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 154 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1251 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:52:39,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 527 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 938 Invalid, 0 Unknown, 1251 Unchecked, 0.6s Time] [2022-10-16 10:52:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-10-16 10:52:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 585. [2022-10-16 10:52:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 578 states have (on average 1.1764705882352942) internal successors, (680), 584 states have internal predecessors, (680), 0 states have call successors, (0), 0 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:52:39,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 680 transitions. [2022-10-16 10:52:39,262 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 680 transitions. Word has length 92 [2022-10-16 10:52:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:52:39,264 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 680 transitions. [2022-10-16 10:52:39,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.78) internal successors, (139), 50 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:52:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 680 transitions. [2022-10-16 10:52:39,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-16 10:52:39,265 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:52:39,266 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:52:39,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-10-16 10:52:39,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-10-16 10:52:39,468 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:52:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:52:39,469 INFO L85 PathProgramCache]: Analyzing trace with hash -315167231, now seen corresponding path program 16 times [2022-10-16 10:52:39,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:52:39,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986669900] [2022-10-16 10:52:39,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:52:39,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:52:39,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:52:39,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151049907] [2022-10-16 10:52:39,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:52:39,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:52:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:52:39,494 INFO L229 MonitoredProcess]: Starting monitored process 45 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:52:39,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-10-16 10:52:39,671 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:52:39,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:52:39,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 55 conjunts are in the unsatisfiable core [2022-10-16 10:52:39,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:52:40,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:52:40,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:52:40,656 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:52:40,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:52:40,863 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:52:41,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:52:41,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:52:41,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:52:41,349 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:52:41,519 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 19 treesize of output 7 [2022-10-16 10:52:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:52:41,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:52:41,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |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)) 3)) is different from false [2022-10-16 10:52:41,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:52:41,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |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|)) 3)) is different from false [2022-10-16 10:52:41,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:52:41,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |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:52:41,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:52:41,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |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|)) 3)) is different from false [2022-10-16 10:52:41,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:52:41,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (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|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 2))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 3)) is different from false [2022-10-16 10:52:41,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:41,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-10-16 10:52:41,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:52:41,986 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 38 treesize of output 34 [2022-10-16 10:52:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 45 trivial. 75 not checked. [2022-10-16 10:52:42,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:52:42,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986669900] [2022-10-16 10:52:42,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:52:42,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151049907] [2022-10-16 10:52:42,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151049907] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:52:42,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:52:42,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2022-10-16 10:52:42,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091213914] [2022-10-16 10:52:42,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:52:42,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-10-16 10:52:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:52:42,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-10-16 10:52:42,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1405, Unknown=9, NotChecked=756, Total=2352 [2022-10-16 10:52:42,663 INFO L87 Difference]: Start difference. First operand 585 states and 680 transitions. Second operand has 49 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)