/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/res2o.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:46:27,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:46:27,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:46:27,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:46:27,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:46:27,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:46:27,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:46:27,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:46:27,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:46:27,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:46:27,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:46:27,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:46:27,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:46:27,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:46:27,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:46:27,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:46:27,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:46:27,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:46:27,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:46:27,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:46:27,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:46:27,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:46:27,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:46:27,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:46:27,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:46:27,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:46:27,222 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:46:27,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:46:27,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:46:27,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:46:27,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:46:27,226 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:46:27,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:46:27,228 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:46:27,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:46:27,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:46:27,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:46:27,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:46:27,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:46:27,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:46:27,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:46:27,233 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:46:27,266 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:46:27,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:46:27,266 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:46:27,267 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:46:27,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:46:27,268 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:46:27,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:46:27,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:46:27,269 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:46:27,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:46:27,270 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:46:27,270 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:46:27,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:46:27,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:46:27,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:46:27,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:46:27,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:46:27,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:46:27,272 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:46:27,272 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:46:27,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:46:27,272 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:46:27,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:46:27,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:46:27,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:46:27,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:46:27,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:46:27,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:46:27,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:46:27,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:46:27,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:46:27,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:46:27,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:46:27,275 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:46:27,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:46:27,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:46:27,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:46:27,723 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:46:27,724 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:46:27,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res2o.c [2022-10-16 10:46:27,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b516ead7/7fc7426b6fe54bc2802bf23fc4e9e8a2/FLAGa1bba5939 [2022-10-16 10:46:28,455 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:46:28,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res2o.c [2022-10-16 10:46:28,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b516ead7/7fc7426b6fe54bc2802bf23fc4e9e8a2/FLAGa1bba5939 [2022-10-16 10:46:28,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b516ead7/7fc7426b6fe54bc2802bf23fc4e9e8a2 [2022-10-16 10:46:28,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:46:28,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:46:28,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:46:28,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:46:28,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:46:28,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:46:28" (1/1) ... [2022-10-16 10:46:28,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6189dfb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:28, skipping insertion in model container [2022-10-16 10:46:28,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:46:28" (1/1) ... [2022-10-16 10:46:28,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:46:28,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:46:29,073 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/res2o.c[588,601] [2022-10-16 10:46:29,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:46:29,143 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:46:29,163 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/res2o.c[588,601] [2022-10-16 10:46:29,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:46:29,235 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:46:29,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29 WrapperNode [2022-10-16 10:46:29,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:46:29,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:46:29,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:46:29,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:46:29,253 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:46:29" (1/1) ... [2022-10-16 10:46:29,279 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:46:29" (1/1) ... [2022-10-16 10:46:29,335 INFO L138 Inliner]: procedures = 17, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2022-10-16 10:46:29,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:46:29,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:46:29,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:46:29,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:46:29,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,414 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:46:29,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:46:29,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:46:29,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:46:29,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (1/1) ... [2022-10-16 10:46:29,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:46:29,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:29,458 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:46:29,489 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:46:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:46:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:46:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:46:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:46:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:46:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:46:29,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:46:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:46:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:46:29,689 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:46:29,691 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:46:29,997 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:46:30,017 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:46:30,018 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-16 10:46:30,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:46:30 BoogieIcfgContainer [2022-10-16 10:46:30,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:46:30,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:46:30,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:46:30,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:46:30,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:46:28" (1/3) ... [2022-10-16 10:46:30,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1506586d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:46:30, skipping insertion in model container [2022-10-16 10:46:30,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:46:29" (2/3) ... [2022-10-16 10:46:30,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1506586d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:46:30, skipping insertion in model container [2022-10-16 10:46:30,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:46:30" (3/3) ... [2022-10-16 10:46:30,031 INFO L112 eAbstractionObserver]: Analyzing ICFG res2o.c [2022-10-16 10:46:30,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:46:30,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-10-16 10:46:30,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:46:30,131 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;@db95621, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:46:30,131 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-10-16 10:46:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 68 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:46:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:46:30,148 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:30,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:30,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:30,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:30,156 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:46:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:30,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621205038] [2022-10-16 10:46:30,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:30,372 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:46:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:30,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621205038] [2022-10-16 10:46:30,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621205038] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:30,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:30,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:46:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69073412] [2022-10-16 10:46:30,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:30,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:46:30,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:30,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:46:30,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:46:30,420 INFO L87 Difference]: Start difference. First operand has 69 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 68 states have internal predecessors, (83), 0 states have call successors, (0), 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:46:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:30,446 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2022-10-16 10:46:30,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:46:30,450 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:46:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:30,462 INFO L225 Difference]: With dead ends: 134 [2022-10-16 10:46:30,464 INFO L226 Difference]: Without dead ends: 63 [2022-10-16 10:46:30,469 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:46:30,480 INFO L413 NwaCegarLoop]: 75 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, 75 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:46:30,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:46:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-16 10:46:30,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-10-16 10:46:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 62 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:46:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-10-16 10:46:30,526 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 8 [2022-10-16 10:46:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:30,526 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-10-16 10:46:30,527 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:46:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-10-16 10:46:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:46:30,528 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:30,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:30,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:46:30,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:30,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:46:30,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:30,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888401370] [2022-10-16 10:46:30,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:30,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:30,783 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:46:30,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:30,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888401370] [2022-10-16 10:46:30,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888401370] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:30,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:30,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:46:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657025847] [2022-10-16 10:46:30,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:30,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:30,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:30,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:30,789 INFO L87 Difference]: Start difference. First operand 63 states and 68 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:46:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:31,019 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-10-16 10:46:31,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:31,022 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:46:31,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:31,027 INFO L225 Difference]: With dead ends: 121 [2022-10-16 10:46:31,028 INFO L226 Difference]: Without dead ends: 119 [2022-10-16 10:46:31,028 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:46:31,032 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 50 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:31,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 130 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-16 10:46:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 67. [2022-10-16 10:46:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.553191489361702) internal successors, (73), 66 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:46:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-10-16 10:46:31,046 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 8 [2022-10-16 10:46:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:31,046 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-10-16 10:46:31,047 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:46:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-10-16 10:46:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 10:46:31,048 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:31,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:31,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:46:31,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:31,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash 678258679, now seen corresponding path program 1 times [2022-10-16 10:46:31,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:31,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590186482] [2022-10-16 10:46:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:31,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:31,192 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:46:31,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:31,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590186482] [2022-10-16 10:46:31,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590186482] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:31,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:31,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:46:31,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794172293] [2022-10-16 10:46:31,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:31,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:31,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:31,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:31,196 INFO L87 Difference]: Start difference. First operand 67 states and 73 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:46:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:31,320 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2022-10-16 10:46:31,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:31,320 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:46:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:31,322 INFO L225 Difference]: With dead ends: 160 [2022-10-16 10:46:31,322 INFO L226 Difference]: Without dead ends: 107 [2022-10-16 10:46:31,323 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:46:31,325 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:31,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 78 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-10-16 10:46:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 70. [2022-10-16 10:46:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-10-16 10:46:31,338 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 10 [2022-10-16 10:46:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:31,338 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-10-16 10:46:31,338 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:46:31,339 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-10-16 10:46:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:46:31,339 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:31,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:31,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:46:31,340 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:46:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:31,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398790865] [2022-10-16 10:46:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:31,525 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:46:31,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:31,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398790865] [2022-10-16 10:46:31,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398790865] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:31,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869363103] [2022-10-16 10:46:31,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:31,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:31,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:31,543 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:46:31,570 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:46:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:31,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:46:31,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:31,736 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:46:31,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:31,801 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:46:31,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869363103] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:31,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:31,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:46:31,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416263888] [2022-10-16 10:46:31,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:31,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:46:31,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:31,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:46:31,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:46:31,805 INFO L87 Difference]: Start difference. First operand 70 states and 75 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:46:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:32,056 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2022-10-16 10:46:32,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:46:32,057 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:46:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:32,068 INFO L225 Difference]: With dead ends: 126 [2022-10-16 10:46:32,069 INFO L226 Difference]: Without dead ends: 125 [2022-10-16 10:46:32,073 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:46:32,077 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 105 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:32,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 198 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-10-16 10:46:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 81. [2022-10-16 10:46:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.467741935483871) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2022-10-16 10:46:32,098 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 12 [2022-10-16 10:46:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:32,099 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2022-10-16 10:46:32,099 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:46:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-10-16 10:46:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:46:32,100 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:32,100 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:32,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-16 10:46:32,305 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:46:32,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:32,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:46:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:32,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782997310] [2022-10-16 10:46:32,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:32,484 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:46:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:32,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782997310] [2022-10-16 10:46:32,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782997310] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:32,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930338820] [2022-10-16 10:46:32,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:32,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:32,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:32,487 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:46:32,504 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:46:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:32,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:46:32,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:32,587 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:46:32,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:46:32,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930338820] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:32,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:46:32,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:46:32,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832222682] [2022-10-16 10:46:32,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:32,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:46:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:32,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:46:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:46:32,590 INFO L87 Difference]: Start difference. First operand 81 states and 91 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:46:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:32,697 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2022-10-16 10:46:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:46:32,698 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:46:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:32,699 INFO L225 Difference]: With dead ends: 118 [2022-10-16 10:46:32,699 INFO L226 Difference]: Without dead ends: 117 [2022-10-16 10:46:32,700 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:46:32,702 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 45 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:32,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 161 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-10-16 10:46:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 80. [2022-10-16 10:46:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 79 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2022-10-16 10:46:32,714 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 13 [2022-10-16 10:46:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:32,714 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2022-10-16 10:46:32,715 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:46:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2022-10-16 10:46:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:46:32,716 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:32,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:32,756 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:46:32,930 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:46:32,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:32,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash -825622541, now seen corresponding path program 1 times [2022-10-16 10:46:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:32,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551922661] [2022-10-16 10:46:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:33,006 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:46:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:33,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551922661] [2022-10-16 10:46:33,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551922661] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:33,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:33,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:46:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836568582] [2022-10-16 10:46:33,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:33,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:33,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:33,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:33,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:33,009 INFO L87 Difference]: Start difference. First operand 80 states and 88 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:46:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:33,080 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-10-16 10:46:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:33,081 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:46:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:33,082 INFO L225 Difference]: With dead ends: 117 [2022-10-16 10:46:33,083 INFO L226 Difference]: Without dead ends: 115 [2022-10-16 10:46:33,083 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:46:33,084 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 38 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:33,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 133 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-10-16 10:46:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2022-10-16 10:46:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.4) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-10-16 10:46:33,096 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 14 [2022-10-16 10:46:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:33,096 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-10-16 10:46:33,097 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:46:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-10-16 10:46:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 10:46:33,098 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:33,098 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:33,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 10:46:33,099 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:33,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1496738415, now seen corresponding path program 1 times [2022-10-16 10:46:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:33,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519597037] [2022-10-16 10:46:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:46:33,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:33,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519597037] [2022-10-16 10:46:33,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519597037] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:33,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574152534] [2022-10-16 10:46:33,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:33,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:33,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:33,220 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:46:33,244 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:46:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:33,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:46:33,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:33,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:33,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574152534] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:33,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:33,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2022-10-16 10:46:33,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35302370] [2022-10-16 10:46:33,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:33,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:46:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:46:33,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:46:33,475 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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:46:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:33,825 INFO L93 Difference]: Finished difference Result 258 states and 277 transitions. [2022-10-16 10:46:33,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:46:33,825 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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 18 [2022-10-16 10:46:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:33,827 INFO L225 Difference]: With dead ends: 258 [2022-10-16 10:46:33,827 INFO L226 Difference]: Without dead ends: 203 [2022-10-16 10:46:33,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:46:33,830 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 300 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:33,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 417 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-10-16 10:46:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 121. [2022-10-16 10:46:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have 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:46:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2022-10-16 10:46:33,853 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 18 [2022-10-16 10:46:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:33,853 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2022-10-16 10:46:33,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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:46:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2022-10-16 10:46:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 10:46:33,858 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:33,858 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] [2022-10-16 10:46:33,897 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:46:34,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:34,060 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash -450019723, now seen corresponding path program 1 times [2022-10-16 10:46:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:34,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187184214] [2022-10-16 10:46:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:34,128 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:46:34,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:34,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187184214] [2022-10-16 10:46:34,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187184214] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:34,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:34,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:46:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553814254] [2022-10-16 10:46:34,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:34,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:34,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:34,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:34,131 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:34,199 INFO L93 Difference]: Finished difference Result 172 states and 212 transitions. [2022-10-16 10:46:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:34,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-16 10:46:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:34,201 INFO L225 Difference]: With dead ends: 172 [2022-10-16 10:46:34,201 INFO L226 Difference]: Without dead ends: 170 [2022-10-16 10:46:34,202 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:46:34,203 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 36 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:34,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 133 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:46:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-10-16 10:46:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 127. [2022-10-16 10:46:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 126 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have 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:46:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2022-10-16 10:46:34,214 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 20 [2022-10-16 10:46:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:34,214 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2022-10-16 10:46:34,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2022-10-16 10:46:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:46:34,215 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:34,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:34,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 10:46:34,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:34,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1488947009, now seen corresponding path program 1 times [2022-10-16 10:46:34,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:34,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104533552] [2022-10-16 10:46:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:34,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:46:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:34,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104533552] [2022-10-16 10:46:34,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104533552] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:34,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413283561] [2022-10-16 10:46:34,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:34,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:34,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:34,315 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:46:34,339 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:46:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:34,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:46:34,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:46:34,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:46:34,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413283561] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:34,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:46:34,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:46:34,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029882539] [2022-10-16 10:46:34,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:34,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:46:34,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:34,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:46:34,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:46:34,439 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:34,527 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2022-10-16 10:46:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:46:34,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 10:46:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:34,529 INFO L225 Difference]: With dead ends: 170 [2022-10-16 10:46:34,529 INFO L226 Difference]: Without dead ends: 169 [2022-10-16 10:46:34,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 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:46:34,530 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 40 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:34,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 204 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-10-16 10:46:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2022-10-16 10:46:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 125 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) [2022-10-16 10:46:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2022-10-16 10:46:34,540 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 23 [2022-10-16 10:46:34,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:34,540 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2022-10-16 10:46:34,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2022-10-16 10:46:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:46:34,542 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:34,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:34,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-16 10:46:34,756 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:46:34,757 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:34,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:34,758 INFO L85 PathProgramCache]: Analyzing trace with hash -151319439, now seen corresponding path program 1 times [2022-10-16 10:46:34,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:34,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652975748] [2022-10-16 10:46:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:34,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:46:34,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:34,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652975748] [2022-10-16 10:46:34,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652975748] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:34,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843618726] [2022-10-16 10:46:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:34,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:34,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:34,850 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:46:34,865 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:46:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:34,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:46:34,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:46:35,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:46:35,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843618726] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:35,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:35,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 15 [2022-10-16 10:46:35,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154429704] [2022-10-16 10:46:35,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:35,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:46:35,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:35,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:46:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:46:35,109 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:35,408 INFO L93 Difference]: Finished difference Result 331 states and 406 transitions. [2022-10-16 10:46:35,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:46:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-16 10:46:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:35,411 INFO L225 Difference]: With dead ends: 331 [2022-10-16 10:46:35,411 INFO L226 Difference]: Without dead ends: 287 [2022-10-16 10:46:35,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:46:35,413 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 249 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:35,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 423 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-10-16 10:46:35,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 138. [2022-10-16 10:46:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 121 states have (on average 1.371900826446281) internal successors, (166), 137 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2022-10-16 10:46:35,423 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 24 [2022-10-16 10:46:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:35,424 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2022-10-16 10:46:35,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-10-16 10:46:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:46:35,425 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:35,426 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:35,466 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:46:35,639 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:46:35,640 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:35,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:46:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:35,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393407401] [2022-10-16 10:46:35,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:35,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:35,853 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:46:35,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:35,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393407401] [2022-10-16 10:46:35,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393407401] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:35,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186874081] [2022-10-16 10:46:35,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:46:35,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:35,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:35,858 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:46:35,881 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:46:35,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:46:35,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:46:35,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:46:35,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:35,993 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:46:35,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:36,038 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:46:36,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186874081] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:36,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:36,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:46:36,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657287387] [2022-10-16 10:46:36,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:36,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:46:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:36,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:46:36,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:46:36,041 INFO L87 Difference]: Start difference. First operand 138 states and 166 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:46:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:36,320 INFO L93 Difference]: Finished difference Result 191 states and 234 transitions. [2022-10-16 10:46:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:46:36,321 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:46:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:36,323 INFO L225 Difference]: With dead ends: 191 [2022-10-16 10:46:36,323 INFO L226 Difference]: Without dead ends: 190 [2022-10-16 10:46:36,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:46:36,324 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 273 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:36,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 137 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:46:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-10-16 10:46:36,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 127. [2022-10-16 10:46:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 126 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have 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:46:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2022-10-16 10:46:36,334 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 24 [2022-10-16 10:46:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:36,335 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2022-10-16 10:46:36,335 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:46:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2022-10-16 10:46:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 10:46:36,336 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:36,336 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] [2022-10-16 10:46:36,373 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:46:36,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:36,552 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:36,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:36,553 INFO L85 PathProgramCache]: Analyzing trace with hash -395986665, now seen corresponding path program 1 times [2022-10-16 10:46:36,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:36,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438625958] [2022-10-16 10:46:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:37,595 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:46:37,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:37,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438625958] [2022-10-16 10:46:37,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438625958] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:37,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396894401] [2022-10-16 10:46:37,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:37,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:37,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:37,598 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:46:37,609 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:46:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:37,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 10:46:37,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:37,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:37,750 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:46:37,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 30 [2022-10-16 10:46:37,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:46:37,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:46:38,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-10-16 10:46:38,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:46:38,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-10-16 10:46:38,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-10-16 10:46:38,307 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:46:38,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:38,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (< (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808)) is different from false [2022-10-16 10:46:38,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (< (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808)) is different from false [2022-10-16 10:46:38,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 Int) (v_ArrVal_424 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (<= v_ArrVal_422 1)) (< (let ((.cse0 (store (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_422)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_424))) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) 9223372036854775808))) is different from false [2022-10-16 10:46:38,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-10-16 10:46:38,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396894401] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:38,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:38,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-10-16 10:46:38,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764112111] [2022-10-16 10:46:38,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:38,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-16 10:46:38,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:38,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-16 10:46:38,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=244, Unknown=3, NotChecked=102, Total=420 [2022-10-16 10:46:38,576 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:39,263 INFO L93 Difference]: Finished difference Result 159 states and 195 transitions. [2022-10-16 10:46:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 10:46:39,264 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 10:46:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:39,265 INFO L225 Difference]: With dead ends: 159 [2022-10-16 10:46:39,265 INFO L226 Difference]: Without dead ends: 157 [2022-10-16 10:46:39,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=459, Unknown=3, NotChecked=144, Total=756 [2022-10-16 10:46:39,267 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 146 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:39,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 459 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 218 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2022-10-16 10:46:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-10-16 10:46:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 131. [2022-10-16 10:46:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 115 states have (on average 1.3652173913043477) internal successors, (157), 130 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have 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:46:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2022-10-16 10:46:39,284 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 25 [2022-10-16 10:46:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:39,284 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2022-10-16 10:46:39,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.35) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2022-10-16 10:46:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:46:39,285 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:39,285 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:39,329 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:46:39,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:39,499 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:39,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:39,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1201818393, now seen corresponding path program 2 times [2022-10-16 10:46:39,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:39,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048948091] [2022-10-16 10:46:39,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:39,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:46:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:39,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048948091] [2022-10-16 10:46:39,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048948091] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:39,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872129768] [2022-10-16 10:46:39,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:46:39,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:39,684 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:46:39,704 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:46:39,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:46:39,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:46:39,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:46:39,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:46:39,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:46:39,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872129768] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:39,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:39,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 16 [2022-10-16 10:46:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602955862] [2022-10-16 10:46:39,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:39,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:46:39,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:46:39,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:46:39,877 INFO L87 Difference]: Start difference. First operand 131 states and 157 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:46:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:40,351 INFO L93 Difference]: Finished difference Result 397 states and 489 transitions. [2022-10-16 10:46:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:46:40,352 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 26 [2022-10-16 10:46:40,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:40,354 INFO L225 Difference]: With dead ends: 397 [2022-10-16 10:46:40,354 INFO L226 Difference]: Without dead ends: 310 [2022-10-16 10:46:40,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:46:40,356 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 510 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:40,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 341 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-10-16 10:46:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 142. [2022-10-16 10:46:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 127 states have (on average 1.3385826771653544) 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:46:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2022-10-16 10:46:40,376 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 26 [2022-10-16 10:46:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:40,376 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2022-10-16 10:46:40,377 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:46:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2022-10-16 10:46:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 10:46:40,378 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:40,378 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, 1, 1] [2022-10-16 10:46:40,421 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:46:40,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-16 10:46:40,592 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1436534393, now seen corresponding path program 1 times [2022-10-16 10:46:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:40,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83010508] [2022-10-16 10:46:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:46:40,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:40,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83010508] [2022-10-16 10:46:40,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83010508] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:40,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:46:40,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:46:40,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471929081] [2022-10-16 10:46:40,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:40,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:40,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:40,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:40,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:46:40,660 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:40,729 INFO L93 Difference]: Finished difference Result 179 states and 217 transitions. [2022-10-16 10:46:40,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:40,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-16 10:46:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:40,731 INFO L225 Difference]: With dead ends: 179 [2022-10-16 10:46:40,731 INFO L226 Difference]: Without dead ends: 177 [2022-10-16 10:46:40,732 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:46:40,733 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:40,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 124 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:46:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-10-16 10:46:40,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 148. [2022-10-16 10:46:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 147 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have 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:46:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2022-10-16 10:46:40,752 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 28 [2022-10-16 10:46:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:40,753 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2022-10-16 10:46:40,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2022-10-16 10:46:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:46:40,754 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:40,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:40,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 10:46:40,754 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:40,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1409249937, now seen corresponding path program 1 times [2022-10-16 10:46:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:40,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945017489] [2022-10-16 10:46:40,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:40,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:46:40,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:40,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945017489] [2022-10-16 10:46:40,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945017489] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:40,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936945410] [2022-10-16 10:46:40,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:40,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:40,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:40,898 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:46:40,903 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:46:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:40,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:46:40,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:46:41,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:46:41,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936945410] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:41,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:41,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:46:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415743107] [2022-10-16 10:46:41,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:41,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:46:41,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:41,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:46:41,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:46:41,123 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 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:46:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:41,544 INFO L93 Difference]: Finished difference Result 293 states and 335 transitions. [2022-10-16 10:46:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:46:41,544 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 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 29 [2022-10-16 10:46:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:41,546 INFO L225 Difference]: With dead ends: 293 [2022-10-16 10:46:41,546 INFO L226 Difference]: Without dead ends: 239 [2022-10-16 10:46:41,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:46:41,548 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 221 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:41,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 586 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:46:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-10-16 10:46:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 148. [2022-10-16 10:46:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 133 states have (on average 1.3082706766917294) internal successors, (174), 147 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have 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:46:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2022-10-16 10:46:41,566 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 29 [2022-10-16 10:46:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:41,567 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2022-10-16 10:46:41,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 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:46:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2022-10-16 10:46:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-16 10:46:41,568 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:41,568 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, 1] [2022-10-16 10:46:41,607 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:46:41,783 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,SelfDestructingSolverStorable14 [2022-10-16 10:46:41,784 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:41,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash 742079389, now seen corresponding path program 1 times [2022-10-16 10:46:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:41,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193647686] [2022-10-16 10:46:41,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:46:41,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:41,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193647686] [2022-10-16 10:46:41,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193647686] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:41,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816649754] [2022-10-16 10:46:41,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:41,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:41,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:41,943 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:46:41,965 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:46:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:42,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:46:42,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:46:42,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:46:42,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816649754] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:42,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:42,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:46:42,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535258997] [2022-10-16 10:46:42,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:42,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:46:42,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:42,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:46:42,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:46:42,194 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:46:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:42,471 INFO L93 Difference]: Finished difference Result 260 states and 298 transitions. [2022-10-16 10:46:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:46:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 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 31 [2022-10-16 10:46:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:42,474 INFO L225 Difference]: With dead ends: 260 [2022-10-16 10:46:42,474 INFO L226 Difference]: Without dead ends: 227 [2022-10-16 10:46:42,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:46:42,476 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 192 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:42,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 359 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:46:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-10-16 10:46:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 156. [2022-10-16 10:46:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 155 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:46:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 182 transitions. [2022-10-16 10:46:42,498 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 182 transitions. Word has length 31 [2022-10-16 10:46:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:42,498 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 182 transitions. [2022-10-16 10:46:42,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:46:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 182 transitions. [2022-10-16 10:46:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:46:42,499 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:42,500 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:42,546 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:46:42,714 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,SelfDestructingSolverStorable15 [2022-10-16 10:46:42,714 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:42,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash 173677741, now seen corresponding path program 1 times [2022-10-16 10:46:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:42,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337037382] [2022-10-16 10:46:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:44,076 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:46:44,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:44,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337037382] [2022-10-16 10:46:44,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337037382] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:44,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837766384] [2022-10-16 10:46:44,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:44,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:44,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:44,078 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:46:44,099 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:46:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:44,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 10:46:44,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:44,196 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:46:44,210 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:46:44,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2022-10-16 10:46:44,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:46:44,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 10:46:44,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-10-16 10:46:45,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-10-16 10:46:45,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2022-10-16 10:46:45,796 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:46:45,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:47,089 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:46:47,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837766384] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:47,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:47,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-10-16 10:46:47,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561374976] [2022-10-16 10:46:47,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:47,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-10-16 10:46:47,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:47,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-10-16 10:46:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1002, Unknown=0, NotChecked=0, Total=1190 [2022-10-16 10:46:47,093 INFO L87 Difference]: Start difference. First operand 156 states and 182 transitions. Second operand has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:48,213 INFO L93 Difference]: Finished difference Result 162 states and 188 transitions. [2022-10-16 10:46:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:46:48,213 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-16 10:46:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:48,215 INFO L225 Difference]: With dead ends: 162 [2022-10-16 10:46:48,215 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:46:48,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2022-10-16 10:46:48,217 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 74 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:48,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 688 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 161 Invalid, 0 Unknown, 337 Unchecked, 0.2s Time] [2022-10-16 10:46:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:46:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-10-16 10:46:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 158 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have 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:46:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2022-10-16 10:46:48,264 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 33 [2022-10-16 10:46:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:48,264 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2022-10-16 10:46:48,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:46:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2022-10-16 10:46:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-16 10:46:48,265 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:48,265 INFO L195 NwaCegarLoop]: trace histogram [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:46:48,304 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:46:48,468 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,SelfDestructingSolverStorable16 [2022-10-16 10:46:48,468 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:48,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1206190229, now seen corresponding path program 2 times [2022-10-16 10:46:48,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:48,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827979555] [2022-10-16 10:46:48,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:46:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827979555] [2022-10-16 10:46:48,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827979555] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316518366] [2022-10-16 10:46:48,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:46:48,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:48,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:48,559 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:46:48,577 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:46:48,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:46:48,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:46:48,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:46:48,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:46:48,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:46:48,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316518366] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:46:48,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:46:48,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-10-16 10:46:48,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494637297] [2022-10-16 10:46:48,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:46:48,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:46:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:48,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:46:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:46:48,679 INFO L87 Difference]: Start difference. First operand 159 states and 185 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:46:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:46:48,748 INFO L93 Difference]: Finished difference Result 159 states and 185 transitions. [2022-10-16 10:46:48,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:46:48,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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 33 [2022-10-16 10:46:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:46:48,750 INFO L225 Difference]: With dead ends: 159 [2022-10-16 10:46:48,750 INFO L226 Difference]: Without dead ends: 158 [2022-10-16 10:46:48,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-10-16 10:46:48,751 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:46:48,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:46:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-10-16 10:46:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-10-16 10:46:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.2708333333333333) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have 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:46:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2022-10-16 10:46:48,771 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 33 [2022-10-16 10:46:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:46:48,772 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2022-10-16 10:46:48,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:46:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2022-10-16 10:46:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:46:48,773 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:46:48,774 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:46:48,809 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:46:48,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 10:46:48,989 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:46:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:46:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1089042807, now seen corresponding path program 1 times [2022-10-16 10:46:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:46:48,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750333714] [2022-10-16 10:46:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:46:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:50,408 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:46:50,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:46:50,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750333714] [2022-10-16 10:46:50,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750333714] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:46:50,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539843993] [2022-10-16 10:46:50,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:46:50,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:46:50,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:46:50,410 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:46:50,431 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:46:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:46:50,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:46:50,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:46:50,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-10-16 10:46:50,583 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:46:50,707 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-10-16 10:46:50,707 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 19 treesize of output 18 [2022-10-16 10:46:50,794 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 18 [2022-10-16 10:46:50,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:46:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:46:50,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:46:53,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_777 Int)) (or (< (+ v_ArrVal_777 9223372036854775808) 0) (< 0 (+ v_ArrVal_777 (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_777))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809)))) is different from false [2022-10-16 10:46:55,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_777 Int)) (or (< (+ v_ArrVal_777 9223372036854775808) 0) (< 0 (+ v_ArrVal_777 9223372036854775809 (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| 1)))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_777))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) is different from false [2022-10-16 10:46:55,261 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 754 treesize of output 738 [2022-10-16 10:46:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-10-16 10:46:57,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539843993] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:46:57,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:46:57,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2022-10-16 10:46:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856975489] [2022-10-16 10:46:57,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:46:57,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-16 10:46:57,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:46:57,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-16 10:46:57,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=560, Unknown=3, NotChecked=102, Total=812 [2022-10-16 10:46:57,329 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:46:59,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_777 Int)) (or (< (+ v_ArrVal_777 9223372036854775808) 0) (< 0 (+ v_ArrVal_777 9223372036854775809 (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| 1)))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_777))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= (select .cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) is different from false [2022-10-16 10:47:01,526 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_777 Int)) (or (< (+ v_ArrVal_777 9223372036854775808) 0) (< 0 (+ v_ArrVal_777 9223372036854775809 (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset| 1)))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_777))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse1 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) is different from false [2022-10-16 10:47:03,535 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|ULTIMATE.start_main_~c~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_777 Int)) (or (< (+ v_ArrVal_777 9223372036854775808) 0) (< 0 (+ v_ArrVal_777 (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~c~0#1.offset|) 1)))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_777))) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse1 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) is different from false [2022-10-16 10:47:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:03,900 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2022-10-16 10:47:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:47:03,905 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 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:47:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:03,907 INFO L225 Difference]: With dead ends: 207 [2022-10-16 10:47:03,907 INFO L226 Difference]: Without dead ends: 206 [2022-10-16 10:47:03,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=224, Invalid=912, Unknown=6, NotChecked=340, Total=1482 [2022-10-16 10:47:03,909 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 124 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:03,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 586 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 341 Invalid, 0 Unknown, 154 Unchecked, 0.3s Time] [2022-10-16 10:47:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-16 10:47:03,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 159. [2022-10-16 10:47:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 145 states have (on average 1.2689655172413794) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2022-10-16 10:47:03,939 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 34 [2022-10-16 10:47:03,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:03,940 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2022-10-16 10:47:03,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.357142857142857) internal successors, (94), 29 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have 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:47:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2022-10-16 10:47:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:47:03,942 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:03,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:03,986 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:47:04,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:04,159 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:04,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:04,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1401878407, now seen corresponding path program 1 times [2022-10-16 10:47:04,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:04,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318451309] [2022-10-16 10:47:04,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:04,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:47:04,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:04,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318451309] [2022-10-16 10:47:04,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318451309] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:04,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:04,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:47:04,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12398199] [2022-10-16 10:47:04,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:04,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:47:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:04,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:47:04,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:47:04,236 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:04,319 INFO L93 Difference]: Finished difference Result 188 states and 221 transitions. [2022-10-16 10:47:04,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:47:04,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-10-16 10:47:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:04,321 INFO L225 Difference]: With dead ends: 188 [2022-10-16 10:47:04,321 INFO L226 Difference]: Without dead ends: 186 [2022-10-16 10:47:04,322 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:47:04,323 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 28 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:04,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 125 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-10-16 10:47:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2022-10-16 10:47:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have 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:47:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2022-10-16 10:47:04,349 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 36 [2022-10-16 10:47:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:04,349 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2022-10-16 10:47:04,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2022-10-16 10:47:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:47:04,350 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:04,350 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:04,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 10:47:04,351 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:04,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1916801253, now seen corresponding path program 2 times [2022-10-16 10:47:04,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:04,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184519268] [2022-10-16 10:47:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:04,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:47:04,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:04,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184519268] [2022-10-16 10:47:04,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184519268] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:04,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318200524] [2022-10-16 10:47:04,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:47:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:04,544 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:47:04,567 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:47:04,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:47:04,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:04,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:47:04,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:47:04,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:47:04,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318200524] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:04,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:04,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 16 [2022-10-16 10:47:04,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941641464] [2022-10-16 10:47:04,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:04,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:47:04,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:04,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:47:04,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:47:04,790 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:05,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:05,274 INFO L93 Difference]: Finished difference Result 300 states and 338 transitions. [2022-10-16 10:47:05,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 10:47:05,274 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-10-16 10:47:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:05,276 INFO L225 Difference]: With dead ends: 300 [2022-10-16 10:47:05,276 INFO L226 Difference]: Without dead ends: 250 [2022-10-16 10:47:05,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 10:47:05,280 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 320 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:05,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 307 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:47:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-10-16 10:47:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 164. [2022-10-16 10:47:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 151 states have (on average 1.2649006622516556) internal successors, (191), 163 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have 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:47:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2022-10-16 10:47:05,306 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 36 [2022-10-16 10:47:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:05,306 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2022-10-16 10:47:05,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2022-10-16 10:47:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-16 10:47:05,307 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:05,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:05,354 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:47:05,522 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:47:05,523 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:05,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:05,523 INFO L85 PathProgramCache]: Analyzing trace with hash 902500083, now seen corresponding path program 1 times [2022-10-16 10:47:05,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:05,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654303935] [2022-10-16 10:47:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:05,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:47:05,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:05,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654303935] [2022-10-16 10:47:05,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654303935] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:05,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389113141] [2022-10-16 10:47:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:05,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:05,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:05,703 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:47:05,722 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:47:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:05,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:47:05,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:47:05,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:47:06,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389113141] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:06,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:06,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:47:06,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946310335] [2022-10-16 10:47:06,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:06,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:47:06,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:06,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:47:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:47:06,011 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:06,291 INFO L93 Difference]: Finished difference Result 227 states and 258 transitions. [2022-10-16 10:47:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:47:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-10-16 10:47:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:06,293 INFO L225 Difference]: With dead ends: 227 [2022-10-16 10:47:06,293 INFO L226 Difference]: Without dead ends: 206 [2022-10-16 10:47:06,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:47:06,294 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 186 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:06,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 274 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:47:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-10-16 10:47:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 168. [2022-10-16 10:47:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 155 states have (on average 1.2580645161290323) internal successors, (195), 167 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have 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:47:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2022-10-16 10:47:06,316 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 39 [2022-10-16 10:47:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:06,317 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2022-10-16 10:47:06,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2022-10-16 10:47:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-16 10:47:06,318 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:06,318 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-10-16 10:47:06,355 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:47:06,521 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:47:06,522 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:06,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash -525159387, now seen corresponding path program 2 times [2022-10-16 10:47:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:06,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964312988] [2022-10-16 10:47:06,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:47:06,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:06,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964312988] [2022-10-16 10:47:06,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964312988] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:06,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991753451] [2022-10-16 10:47:06,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:47:06,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:06,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:06,667 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:47:06,678 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:47:06,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:47:06,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:06,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:47:06,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:47:06,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 10:47:06,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991753451] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:06,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:06,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:47:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246475035] [2022-10-16 10:47:06,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:06,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:47:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:06,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:47:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:47:06,993 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:07,384 INFO L93 Difference]: Finished difference Result 254 states and 287 transitions. [2022-10-16 10:47:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:47:07,384 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-10-16 10:47:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:07,386 INFO L225 Difference]: With dead ends: 254 [2022-10-16 10:47:07,386 INFO L226 Difference]: Without dead ends: 209 [2022-10-16 10:47:07,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:47:07,387 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 232 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:07,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 447 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:47:07,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-10-16 10:47:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 168. [2022-10-16 10:47:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 167 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 193 transitions. [2022-10-16 10:47:07,409 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 193 transitions. Word has length 39 [2022-10-16 10:47:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:07,409 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 193 transitions. [2022-10-16 10:47:07,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 16 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 193 transitions. [2022-10-16 10:47:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:47:07,410 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:07,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:07,450 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:47:07,624 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:47:07,624 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:07,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash -280857277, now seen corresponding path program 1 times [2022-10-16 10:47:07,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:07,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899609737] [2022-10-16 10:47:07,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:07,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:09,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:09,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899609737] [2022-10-16 10:47:09,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899609737] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:09,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855296018] [2022-10-16 10:47:09,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:09,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:09,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:09,836 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:47:09,837 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:47:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:09,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 59 conjunts are in the unsatisfiable core [2022-10-16 10:47:09,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:09,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:09,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:09,980 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:47:09,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 35 [2022-10-16 10:47:10,012 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:47:10,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:47:10,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:10,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-10-16 10:47:10,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:10,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:10,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-10-16 10:47:11,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:11,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:11,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-10-16 10:47:12,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:12,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:12,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-10-16 10:47:12,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:12,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:12,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2022-10-16 10:47:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:12,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:18,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855296018] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:18,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:18,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2022-10-16 10:47:18,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453217900] [2022-10-16 10:47:18,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:18,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-10-16 10:47:18,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:18,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-10-16 10:47:18,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1670, Unknown=1, NotChecked=0, Total=1892 [2022-10-16 10:47:18,196 INFO L87 Difference]: Start difference. First operand 168 states and 193 transitions. Second operand has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 44 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:47:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:22,740 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2022-10-16 10:47:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 10:47:22,741 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 44 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 41 [2022-10-16 10:47:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:22,742 INFO L225 Difference]: With dead ends: 174 [2022-10-16 10:47:22,742 INFO L226 Difference]: Without dead ends: 173 [2022-10-16 10:47:22,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=471, Invalid=2834, Unknown=1, NotChecked=0, Total=3306 [2022-10-16 10:47:22,745 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 103 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:22,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 751 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 279 Invalid, 0 Unknown, 355 Unchecked, 0.3s Time] [2022-10-16 10:47:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-10-16 10:47:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-10-16 10:47:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 158 states have (on average 1.240506329113924) internal successors, (196), 170 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have 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:47:22,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2022-10-16 10:47:22,768 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 41 [2022-10-16 10:47:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:22,769 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2022-10-16 10:47:22,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.6744186046511627) internal successors, (115), 44 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:47:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2022-10-16 10:47:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 10:47:22,770 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:22,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:22,805 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:47:22,986 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:47:22,986 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:22,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -116640841, now seen corresponding path program 1 times [2022-10-16 10:47:22,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:22,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570847705] [2022-10-16 10:47:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:22,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:25,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:25,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570847705] [2022-10-16 10:47:25,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570847705] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:25,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579590617] [2022-10-16 10:47:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:25,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:25,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:25,159 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:47:25,170 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:47:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:25,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-16 10:47:25,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:25,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:47:25,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:25,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:47:25,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:25,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-10-16 10:47:25,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:25,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:47:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:47:25,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:25,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:25,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-10-16 10:47:25,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ 9223372036854775808 .cse0) 0) (< 0 (+ 9223372036854775809 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))))) is different from false [2022-10-16 10:47:26,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:26,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-10-16 10:47:26,048 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:26,049 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 44 treesize of output 42 [2022-10-16 10:47:26,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:26,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2022-10-16 10:47:26,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-10-16 10:47:26,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579590617] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:26,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:26,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 8] total 28 [2022-10-16 10:47:26,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877996938] [2022-10-16 10:47:26,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:26,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-16 10:47:26,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:26,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-16 10:47:26,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=630, Unknown=2, NotChecked=52, Total=812 [2022-10-16 10:47:26,919 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. Second operand has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 29 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:47:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:28,858 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2022-10-16 10:47:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-16 10:47:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 29 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 42 [2022-10-16 10:47:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:28,860 INFO L225 Difference]: With dead ends: 248 [2022-10-16 10:47:28,860 INFO L226 Difference]: Without dead ends: 246 [2022-10-16 10:47:28,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=431, Invalid=1827, Unknown=2, NotChecked=92, Total=2352 [2022-10-16 10:47:28,862 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 454 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:28,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 348 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 290 Invalid, 0 Unknown, 91 Unchecked, 0.4s Time] [2022-10-16 10:47:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-10-16 10:47:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 186. [2022-10-16 10:47:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 173 states have (on average 1.254335260115607) internal successors, (217), 185 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have 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:47:28,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 217 transitions. [2022-10-16 10:47:28,892 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 217 transitions. Word has length 42 [2022-10-16 10:47:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:28,892 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 217 transitions. [2022-10-16 10:47:28,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.214285714285714) internal successors, (118), 29 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:47:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 217 transitions. [2022-10-16 10:47:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 10:47:28,893 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:28,894 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, 1, 1] [2022-10-16 10:47:28,923 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:47:29,107 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:47:29,108 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:29,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1182889, now seen corresponding path program 3 times [2022-10-16 10:47:29,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:29,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300274092] [2022-10-16 10:47:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:29,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:30,659 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:47:30,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:30,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300274092] [2022-10-16 10:47:30,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300274092] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:30,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796995087] [2022-10-16 10:47:30,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:47:30,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:30,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:30,661 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:47:30,665 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:47:30,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:47:30,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:30,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 10:47:30,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:30,810 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:47:30,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:30,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:30,826 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:47:30,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 26 [2022-10-16 10:47:30,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:47:31,206 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 10:47:31,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2022-10-16 10:47:31,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:31,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:47:31,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:31,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:47:32,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:32,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:47:32,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:32,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-10-16 10:47:32,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:47:32,782 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:47:32,783 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 44 [2022-10-16 10:47:33,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:47:33,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:33,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 16 [2022-10-16 10:47:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:47:33,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:35,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0)))))) is different from false [2022-10-16 10:47:36,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< |c_ULTIMATE.start_main_#t~post8#1| |v_ULTIMATE.start_main_~i~0#1_151|) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1))))) is different from false [2022-10-16 10:47:36,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_151|) (< |v_ULTIMATE.start_main_~i~0#1_151| 1))))) is different from false [2022-10-16 10:47:36,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (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_1170)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1170 1)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_151|) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176))))) is different from false [2022-10-16 10:47:37,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_160| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (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_160| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1170)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_160|) (< |v_ULTIMATE.start_main_~i~0#1_160| |v_ULTIMATE.start_main_~i~0#1_151|) (not (<= v_ArrVal_1170 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (< (+ v_ArrVal_1176 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808))))) is different from false [2022-10-16 10:47:37,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 Int) (v_ArrVal_1167 Int) (|v_ULTIMATE.start_main_~i~0#1_160| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1172 (Array Int Int))) (let ((.cse0 (store (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_1167) (+ (* |v_ULTIMATE.start_main_~i~0#1_160| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1170)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1167 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_160|) (< |v_ULTIMATE.start_main_~i~0#1_160| |v_ULTIMATE.start_main_~i~0#1_151|) (not (<= v_ArrVal_1170 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1))))) is different from false [2022-10-16 10:47:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 16 not checked. [2022-10-16 10:47:37,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796995087] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:37,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:37,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 47 [2022-10-16 10:47:37,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697906833] [2022-10-16 10:47:37,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:37,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-10-16 10:47:37,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:37,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-10-16 10:47:37,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1530, Unknown=40, NotChecked=510, Total=2256 [2022-10-16 10:47:37,310 INFO L87 Difference]: Start difference. First operand 186 states and 217 transitions. Second operand has 48 states, 47 states have (on average 2.574468085106383) internal successors, (121), 48 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:47:38,938 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= .cse0 0) (<= .cse1 1) (= .cse1 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_160| Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1170 Int) (v_ArrVal_1172 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~0#1_160| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1170)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_160|) (< |v_ULTIMATE.start_main_~i~0#1_160| |v_ULTIMATE.start_main_~i~0#1_151|) (not (<= v_ArrVal_1170 1)) (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (< (+ v_ArrVal_1176 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 9223372036854775808))))) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse0 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-10-16 10:47:46,119 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0)))))) (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1172) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0))))))) is different from false [2022-10-16 10:47:46,285 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int) (v_ArrVal_1174 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1174))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0)))))) (forall ((v_ArrVal_1176 Int) (|v_ULTIMATE.start_main_~i~0#1_151| Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1176)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_151| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) 9223372036854775808) (< (+ (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1176) (< |v_ULTIMATE.start_main_~i~0#1_151| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_151| c_~N~0)))))) is different from false [2022-10-16 10:47:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:47,082 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2022-10-16 10:47:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-10-16 10:47:47,083 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.574468085106383) internal successors, (121), 48 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) Word has length 43 [2022-10-16 10:47:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:47,085 INFO L225 Difference]: With dead ends: 227 [2022-10-16 10:47:47,085 INFO L226 Difference]: Without dead ends: 226 [2022-10-16 10:47:47,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=359, Invalid=3051, Unknown=48, NotChecked=1098, Total=4556 [2022-10-16 10:47:47,088 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 628 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:47,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 843 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 281 Invalid, 0 Unknown, 628 Unchecked, 0.3s Time] [2022-10-16 10:47:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-10-16 10:47:47,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-10-16 10:47:47,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 213 states have (on average 1.244131455399061) internal successors, (265), 225 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have 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:47:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 265 transitions. [2022-10-16 10:47:47,125 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 265 transitions. Word has length 43 [2022-10-16 10:47:47,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:47,125 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 265 transitions. [2022-10-16 10:47:47,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.574468085106383) internal successors, (121), 48 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:47:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 265 transitions. [2022-10-16 10:47:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 10:47:47,126 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:47,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:47,158 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:47:47,342 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:47:47,343 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:47,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:47,344 INFO L85 PathProgramCache]: Analyzing trace with hash -422693511, now seen corresponding path program 1 times [2022-10-16 10:47:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:47,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054869286] [2022-10-16 10:47:47,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:47,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 10:47:47,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:47,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054869286] [2022-10-16 10:47:47,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054869286] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:47,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:47,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:47:47,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841823393] [2022-10-16 10:47:47,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:47,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:47:47,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:47,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:47:47,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:47:47,415 INFO L87 Difference]: Start difference. First operand 226 states and 265 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:47,528 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2022-10-16 10:47:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:47:47,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-10-16 10:47:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:47,530 INFO L225 Difference]: With dead ends: 237 [2022-10-16 10:47:47,531 INFO L226 Difference]: Without dead ends: 235 [2022-10-16 10:47:47,531 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:47:47,532 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:47,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 122 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:47,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-10-16 10:47:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2022-10-16 10:47:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 219 states have (on average 1.2374429223744292) internal successors, (271), 231 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have 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:47:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 271 transitions. [2022-10-16 10:47:47,575 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 271 transitions. Word has length 44 [2022-10-16 10:47:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:47,575 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 271 transitions. [2022-10-16 10:47:47,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 271 transitions. [2022-10-16 10:47:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 10:47:47,576 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:47,577 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, 1, 1] [2022-10-16 10:47:47,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-16 10:47:47,577 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:47:47,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:47,578 INFO L85 PathProgramCache]: Analyzing trace with hash 36669669, now seen corresponding path program 1 times [2022-10-16 10:47:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:47,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371262409] [2022-10-16 10:47:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:47,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:47:48,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:48,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371262409] [2022-10-16 10:47:48,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371262409] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:48,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043603257] [2022-10-16 10:47:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:48,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:48,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:48,373 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:47:48,385 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:47:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:48,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-16 10:47:48,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:48,512 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:47:48,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 82 [2022-10-16 10:47:48,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:47:48,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:47:48,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:47:48,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:47:48,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:47:49,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-16 10:47:49,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2022-10-16 10:47:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:47:49,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:50,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1277 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1276 (Array Int Int))) (or (< (+ 9223372036854775808 v_ArrVal_1277) 0) (< 0 (+ (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1276))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 9223372036854775809 v_ArrVal_1277)))) is different from false [2022-10-16 10:47:50,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1277 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (or (< 0 (+ 9223372036854775809 v_ArrVal_1277 (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1274) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1276))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1277))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< (+ 9223372036854775808 v_ArrVal_1277) 0))) is different from false [2022-10-16 10:47:50,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:50,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2022-10-16 10:47:51,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:51,003 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 3498 treesize of output 3448 [2022-10-16 10:47:51,049 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 3574 treesize of output 3462 [2022-10-16 10:47:51,085 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 4614 treesize of output 4198 [2022-10-16 10:47:51,247 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 454 treesize of output 422 [2022-10-16 10:47:55,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:55,686 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 2447 treesize of output 2379 [2022-10-16 10:47:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 15 not checked. [2022-10-16 10:47:59,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043603257] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:59,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:59,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-10-16 10:47:59,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262880256] [2022-10-16 10:47:59,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:59,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 10:47:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:59,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 10:47:59,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=821, Unknown=2, NotChecked=118, Total=1056 [2022-10-16 10:47:59,819 INFO L87 Difference]: Start difference. First operand 232 states and 271 transitions. Second operand has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:00,999 INFO L93 Difference]: Finished difference Result 260 states and 298 transitions. [2022-10-16 10:48:00,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:48:00,999 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 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:48:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:01,001 INFO L225 Difference]: With dead ends: 260 [2022-10-16 10:48:01,002 INFO L226 Difference]: Without dead ends: 259 [2022-10-16 10:48:01,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=232, Invalid=1414, Unknown=2, NotChecked=158, Total=1806 [2022-10-16 10:48:01,004 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 160 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:01,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 788 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 561 Invalid, 0 Unknown, 225 Unchecked, 0.4s Time] [2022-10-16 10:48:01,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-10-16 10:48:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 232. [2022-10-16 10:48:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 219 states have (on average 1.2328767123287672) internal successors, (270), 231 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have 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:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 270 transitions. [2022-10-16 10:48:01,043 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 270 transitions. Word has length 44 [2022-10-16 10:48:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:01,044 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 270 transitions. [2022-10-16 10:48:01,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.71875) internal successors, (119), 33 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 270 transitions. [2022-10-16 10:48:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 10:48:01,045 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:01,045 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, 1, 1, 1, 1] [2022-10-16 10:48:01,086 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:48:01,259 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,SelfDestructingSolverStorable27 [2022-10-16 10:48:01,259 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1136712377, now seen corresponding path program 2 times [2022-10-16 10:48:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829870108] [2022-10-16 10:48:01,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:01,405 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:01,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:01,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829870108] [2022-10-16 10:48:01,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829870108] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:01,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461527237] [2022-10-16 10:48:01,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:01,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:01,410 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:48:01,431 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:48:01,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:48:01,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:01,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:48:01,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:01,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:01,753 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:01,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461527237] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:01,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:01,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:48:01,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109675578] [2022-10-16 10:48:01,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:01,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:48:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:01,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:48:01,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:48:01,756 INFO L87 Difference]: Start difference. First operand 232 states and 270 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 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:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:02,205 INFO L93 Difference]: Finished difference Result 313 states and 360 transitions. [2022-10-16 10:48:02,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 10:48:02,206 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-10-16 10:48:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:02,207 INFO L225 Difference]: With dead ends: 313 [2022-10-16 10:48:02,207 INFO L226 Difference]: Without dead ends: 250 [2022-10-16 10:48:02,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2022-10-16 10:48:02,209 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 220 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:02,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 518 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:48:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-10-16 10:48:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 224. [2022-10-16 10:48:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 211 states have (on average 1.2180094786729858) internal successors, (257), 223 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have 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:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 257 transitions. [2022-10-16 10:48:02,247 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 257 transitions. Word has length 45 [2022-10-16 10:48:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:02,247 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 257 transitions. [2022-10-16 10:48:02,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 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:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 257 transitions. [2022-10-16 10:48:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-16 10:48:02,248 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:02,248 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, 1, 1] [2022-10-16 10:48:02,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-10-16 10:48:02,455 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,SelfDestructingSolverStorable28 [2022-10-16 10:48:02,456 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash 879817127, now seen corresponding path program 1 times [2022-10-16 10:48:02,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:02,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82530587] [2022-10-16 10:48:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:02,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:48:02,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:02,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82530587] [2022-10-16 10:48:02,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82530587] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:02,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595546211] [2022-10-16 10:48:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:02,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:02,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:02,544 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:48:02,573 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:48:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:02,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:48:02,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:48:02,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:48:02,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595546211] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:02,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:02,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:48:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360191591] [2022-10-16 10:48:02,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:02,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:48:02,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:02,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:48:02,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:48:02,735 INFO L87 Difference]: Start difference. First operand 224 states and 257 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:02,916 INFO L93 Difference]: Finished difference Result 268 states and 310 transitions. [2022-10-16 10:48:02,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:48:02,916 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-10-16 10:48:02,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:02,918 INFO L225 Difference]: With dead ends: 268 [2022-10-16 10:48:02,918 INFO L226 Difference]: Without dead ends: 267 [2022-10-16 10:48:02,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 85 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:02,919 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 134 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:02,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 171 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:48:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-10-16 10:48:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 249. [2022-10-16 10:48:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 236 states have (on average 1.2542372881355932) internal successors, (296), 248 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have 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:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 296 transitions. [2022-10-16 10:48:02,957 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 296 transitions. Word has length 46 [2022-10-16 10:48:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:02,957 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 296 transitions. [2022-10-16 10:48:02,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have 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:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 296 transitions. [2022-10-16 10:48:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:48:02,958 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:02,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:02,982 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:48:03,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:03,159 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:03,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash 381884233, now seen corresponding path program 1 times [2022-10-16 10:48:03,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:03,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946597557] [2022-10-16 10:48:03,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:03,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:48:03,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:03,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946597557] [2022-10-16 10:48:03,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946597557] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:03,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019171810] [2022-10-16 10:48:03,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:03,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:03,313 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:48:03,336 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:48:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:03,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:48:03,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:48:03,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 10:48:03,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019171810] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:03,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:03,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:48:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152062310] [2022-10-16 10:48:03,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:03,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:48:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:48:03,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:48:03,675 INFO L87 Difference]: Start difference. First operand 249 states and 296 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:03,941 INFO L93 Difference]: Finished difference Result 267 states and 311 transitions. [2022-10-16 10:48:03,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:48:03,942 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-10-16 10:48:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:03,946 INFO L225 Difference]: With dead ends: 267 [2022-10-16 10:48:03,946 INFO L226 Difference]: Without dead ends: 221 [2022-10-16 10:48:03,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-10-16 10:48:03,949 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 105 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:03,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 287 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:48:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-10-16 10:48:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2022-10-16 10:48:03,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 205 states have (on average 1.2878048780487805) internal successors, (264), 217 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have 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:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2022-10-16 10:48:03,979 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 47 [2022-10-16 10:48:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:03,979 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2022-10-16 10:48:03,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2022-10-16 10:48:03,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:48:03,983 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:03,983 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, 1, 1] [2022-10-16 10:48:04,008 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:48:04,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:04,189 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:04,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:04,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1504527277, now seen corresponding path program 1 times [2022-10-16 10:48:04,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:04,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034036415] [2022-10-16 10:48:04,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:04,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:48:04,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:04,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034036415] [2022-10-16 10:48:04,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034036415] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:04,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439949234] [2022-10-16 10:48:04,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:04,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:04,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:04,280 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:48:04,308 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:48:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:04,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:48:04,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 10:48:04,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:48:04,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439949234] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:48:04,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:48:04,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:48:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708829620] [2022-10-16 10:48:04,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:48:04,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:48:04,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:48:04,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:48:04,438 INFO L87 Difference]: Start difference. First operand 218 states and 264 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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:48:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:04,569 INFO L93 Difference]: Finished difference Result 221 states and 264 transitions. [2022-10-16 10:48:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:48:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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 47 [2022-10-16 10:48:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:04,571 INFO L225 Difference]: With dead ends: 221 [2022-10-16 10:48:04,571 INFO L226 Difference]: Without dead ends: 220 [2022-10-16 10:48:04,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 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:04,572 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:04,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 169 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:48:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-10-16 10:48:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2022-10-16 10:48:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 216 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:48:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 258 transitions. [2022-10-16 10:48:04,605 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 258 transitions. Word has length 47 [2022-10-16 10:48:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:04,606 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 258 transitions. [2022-10-16 10:48:04,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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:48:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 258 transitions. [2022-10-16 10:48:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 10:48:04,607 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:04,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-10-16 10:48:04,650 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:48:04,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:04,821 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:04,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash 671293921, now seen corresponding path program 2 times [2022-10-16 10:48:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:04,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785659439] [2022-10-16 10:48:04,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:48:05,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:05,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785659439] [2022-10-16 10:48:05,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785659439] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:05,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780667526] [2022-10-16 10:48:05,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:05,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:05,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:05,027 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:48:05,046 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:48:05,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:48:05,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:05,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:48:05,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:48:05,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:48:05,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780667526] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:05,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:05,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:48:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587530251] [2022-10-16 10:48:05,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:48:05,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:05,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:48:05,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:48:05,474 INFO L87 Difference]: Start difference. First operand 217 states and 258 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:06,023 INFO L93 Difference]: Finished difference Result 347 states and 388 transitions. [2022-10-16 10:48:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 10:48:06,023 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-10-16 10:48:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:06,025 INFO L225 Difference]: With dead ends: 347 [2022-10-16 10:48:06,025 INFO L226 Difference]: Without dead ends: 248 [2022-10-16 10:48:06,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 78 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 10:48:06,027 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 194 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:06,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 737 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:48:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-10-16 10:48:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 225. [2022-10-16 10:48:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 213 states have (on average 1.2488262910798122) internal successors, (266), 224 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have 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:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2022-10-16 10:48:06,057 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 48 [2022-10-16 10:48:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:06,058 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2022-10-16 10:48:06,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2022-10-16 10:48:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-16 10:48:06,058 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:06,058 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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:48:06,085 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:48:06,259 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,SelfDestructingSolverStorable32 [2022-10-16 10:48:06,260 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:06,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash -906486625, now seen corresponding path program 3 times [2022-10-16 10:48:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:06,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895576776] [2022-10-16 10:48:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:06,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:06,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895576776] [2022-10-16 10:48:06,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895576776] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:06,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879166085] [2022-10-16 10:48:06,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:48:06,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:06,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:06,469 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:48:06,477 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:48:06,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:48:06,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:06,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:48:06,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:06,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 10:48:06,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879166085] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:06,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:06,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:48:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544549467] [2022-10-16 10:48:06,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:06,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:48:06,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:06,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:48:06,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:48:06,950 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 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:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:07,332 INFO L93 Difference]: Finished difference Result 276 states and 304 transitions. [2022-10-16 10:48:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 10:48:07,333 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 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 50 [2022-10-16 10:48:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:07,334 INFO L225 Difference]: With dead ends: 276 [2022-10-16 10:48:07,334 INFO L226 Difference]: Without dead ends: 223 [2022-10-16 10:48:07,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2022-10-16 10:48:07,335 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 211 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:07,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 348 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:48:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-10-16 10:48:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2022-10-16 10:48:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 197 states have (on average 1.2233502538071066) internal successors, (241), 208 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have 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:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 241 transitions. [2022-10-16 10:48:07,367 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 241 transitions. Word has length 50 [2022-10-16 10:48:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:07,367 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 241 transitions. [2022-10-16 10:48:07,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 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:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 241 transitions. [2022-10-16 10:48:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-16 10:48:07,368 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:07,368 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2022-10-16 10:48:07,407 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:48:07,584 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,SelfDestructingSolverStorable33 [2022-10-16 10:48:07,585 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:07,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:07,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1963638335, now seen corresponding path program 3 times [2022-10-16 10:48:07,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:07,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212110278] [2022-10-16 10:48:07,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:07,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:48:10,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:10,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212110278] [2022-10-16 10:48:10,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212110278] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:10,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715197039] [2022-10-16 10:48:10,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:48:10,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:10,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:10,582 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:48:10,582 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:48:10,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:48:10,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:10,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-16 10:48:10,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:10,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:10,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:10,762 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-16 10:48:10,763 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 32 treesize of output 28 [2022-10-16 10:48:10,786 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:48:10,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:10,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:48:11,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:11,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:11,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:48:11,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:11,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:11,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:11,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-10-16 10:48:11,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:11,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:11,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:11,759 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-10-16 10:48:11,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 54 [2022-10-16 10:48:12,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-10-16 10:48:12,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-10-16 10:48:12,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:48:12,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:12,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-10-16 10:48:13,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:13,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:13,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-10-16 10:48:13,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:13,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:13,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2022-10-16 10:48:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 10:48:13,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:14,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1733 Int) (v_ArrVal_1735 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1731))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1733)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1733) v_ArrVal_1735) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1733) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1735) 9223372036854775808))))) is different from false [2022-10-16 10:48:14,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1733 Int) (v_ArrVal_1735 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1731))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1733 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1733)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1735) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1733) (< (+ v_ArrVal_1735 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808))))) is different from false [2022-10-16 10:48:14,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1731 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1733 Int) (v_ArrVal_1735 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1731))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1733 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1733)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1735) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1735) 9223372036854775808) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1733))))) is different from false [2022-10-16 10:48:15,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1731 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1733 Int) (v_ArrVal_1735 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1731))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1735) 9223372036854775808) (< (+ v_ArrVal_1733 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1733)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1735) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1733))))) is different from false [2022-10-16 10:48:15,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1731 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1733 Int) (v_ArrVal_1725 Int) (v_ArrVal_1735 Int)) (let ((.cse0 (store (let ((.cse2 (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_1725)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1731))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1735) 9223372036854775808) (< (+ v_ArrVal_1733 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1733)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1735) (not (<= v_ArrVal_1725 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1733))))) is different from false [2022-10-16 10:48:15,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1731 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1733 Int) (v_ArrVal_1725 Int) (v_ArrVal_1735 Int)) (let ((.cse1 (store (let ((.cse2 (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_#t~post8#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1725)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1731))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1733) (not (<= v_ArrVal_1725 1)) (< (+ v_ArrVal_1735 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1733)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1733) v_ArrVal_1735))))) is different from false [2022-10-16 10:48:15,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1731 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1733 Int) (v_ArrVal_1725 Int) (v_ArrVal_1735 Int)) (let ((.cse0 (store (let ((.cse2 (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| 4) v_ArrVal_1725)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1731))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1733 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1733)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) v_ArrVal_1735) (not (<= v_ArrVal_1725 1)) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1733) (< (+ v_ArrVal_1735 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808))))) is different from false [2022-10-16 10:48:15,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1731 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_232| Int) (v_ArrVal_1723 Int) (v_ArrVal_1733 Int) (v_ArrVal_1725 Int) (v_ArrVal_1735 Int)) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1723) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_1725))))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_232| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1731))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1723 1)) (not (<= v_ArrVal_1725 1)) (< (+ v_ArrVal_1735 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1733) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1733)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1733) v_ArrVal_1735))))) is different from false [2022-10-16 10:48:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 17 not checked. [2022-10-16 10:48:15,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715197039] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:15,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:15,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 56 [2022-10-16 10:48:15,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172844703] [2022-10-16 10:48:15,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:15,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-10-16 10:48:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-10-16 10:48:15,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=2138, Unknown=8, NotChecked=808, Total=3192 [2022-10-16 10:48:15,480 INFO L87 Difference]: Start difference. First operand 209 states and 241 transitions. Second operand has 57 states, 56 states have (on average 2.517857142857143) internal successors, (141), 57 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have 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:23,125 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (select .cse0 .cse6))) (and (= (select .cse0 0) 1) (= .cse1 0) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse2 1) (= (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (select .cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse1 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1733 Int) (v_ArrVal_1735 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1731))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1733 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1733)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) v_ArrVal_1735) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1733) (< (+ v_ArrVal_1735 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse2 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-10-16 10:48:25,071 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (select .cse0 .cse6))) (and (= (select .cse0 0) 1) (= .cse1 0) (<= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse2 1) (= (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= .cse1 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= (select .cse3 0) 1) (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_1731 (Array Int Int)) (v_ArrVal_1733 Int) (v_ArrVal_1735 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1731))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_1733 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1733)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) v_ArrVal_1735) (< (+ (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1733) (< (+ v_ArrVal_1735 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1735)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) 9223372036854775808))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse2 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|)))) is different from false [2022-10-16 10:48:26,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:26,867 INFO L93 Difference]: Finished difference Result 219 states and 247 transitions. [2022-10-16 10:48:26,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-16 10:48:26,867 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.517857142857143) internal successors, (141), 57 states have internal predecessors, (141), 0 states have call successors, (0), 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 51 [2022-10-16 10:48:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:26,869 INFO L225 Difference]: With dead ends: 219 [2022-10-16 10:48:26,869 INFO L226 Difference]: Without dead ends: 217 [2022-10-16 10:48:26,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=467, Invalid=3722, Unknown=11, NotChecked=1350, Total=5550 [2022-10-16 10:48:26,873 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 135 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 811 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:26,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 856 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 634 Invalid, 0 Unknown, 811 Unchecked, 0.6s Time] [2022-10-16 10:48:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-10-16 10:48:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 175. [2022-10-16 10:48:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 163 states have (on average 1.2392638036809815) internal successors, (202), 174 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have 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:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2022-10-16 10:48:26,901 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 51 [2022-10-16 10:48:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:26,902 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2022-10-16 10:48:26,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.517857142857143) internal successors, (141), 57 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have 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:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2022-10-16 10:48:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 10:48:26,903 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:26,903 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2022-10-16 10:48:26,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-10-16 10:48:27,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-10-16 10:48:27,118 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash 743246373, now seen corresponding path program 2 times [2022-10-16 10:48:27,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:27,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27867329] [2022-10-16 10:48:27,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:27,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 10:48:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:29,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27867329] [2022-10-16 10:48:29,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27867329] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:29,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481699318] [2022-10-16 10:48:29,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:29,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:29,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:29,780 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:48:29,781 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:48:29,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:48:29,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:29,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 27 conjunts are in the unsatisfiable core [2022-10-16 10:48:29,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:29,928 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 838 treesize of output 822 [2022-10-16 10:48:30,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:48:30,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:30,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:48:30,403 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:48:30,439 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:48:30,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:30,537 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:48:30,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:30,587 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 18 [2022-10-16 10:48:30,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:30,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:48:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:48:30,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:32,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1811 Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1811)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809 v_ArrVal_1811)) (< (+ 9223372036854775808 v_ArrVal_1811) 0))) is different from false [2022-10-16 10:48:32,043 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:48:32,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-10-16 10:48:32,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 9223372036854775808) 0) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809 .cse0))))) is different from false [2022-10-16 10:48:32,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1808 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 9223372036854775808) 0) (< 0 (+ 9223372036854775809 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1808) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse0))))) is different from false [2022-10-16 10:48:32,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1808 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 9223372036854775808) 0) (< 0 (+ 9223372036854775809 .cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1805)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1808) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) is different from false [2022-10-16 10:48:32,209 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int)) (or (forall ((v_ArrVal_1805 Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1808 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 9223372036854775808) 0) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_245| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1805)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1808) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809 .cse0))))) (not (<= (+ |c_ULTIMATE.start_main_#t~post9#1| 1) |v_ULTIMATE.start_main_~i~0#1_245|)))) is different from false [2022-10-16 10:48:32,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (v_ArrVal_1805 Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1808 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse0 9223372036854775808) 0) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_245| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1805)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1808) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809 .cse0)) (< |v_ULTIMATE.start_main_~i~0#1_245| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2022-10-16 10:48:32,274 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-10-16 10:48:32,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2022-10-16 10:48:32,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:48:32,287 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 166 treesize of output 160 [2022-10-16 10:48:32,298 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 73 treesize of output 69 [2022-10-16 10:48:32,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:48:32,311 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 149 treesize of output 131 [2022-10-16 10:48:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 19 not checked. [2022-10-16 10:48:32,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481699318] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:32,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:32,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 12] total 42 [2022-10-16 10:48:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775211392] [2022-10-16 10:48:32,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:32,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-10-16 10:48:32,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:32,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-10-16 10:48:32,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1189, Unknown=6, NotChecked=450, Total=1806 [2022-10-16 10:48:32,515 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand has 43 states, 42 states have (on average 3.261904761904762) internal successors, (137), 43 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have 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:33,226 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse4 (select .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (v_ArrVal_1805 Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1808 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse1 9223372036854775808) 0) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_245| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1805)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1808) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809 .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_245| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) (= .cse3 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)) (<= 1 .cse4) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= .cse4 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 (+ .cse3 9223372036854775808)) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))))) is different from false [2022-10-16 10:48:35,234 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 0) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int)) (or (forall ((v_ArrVal_1805 Int) (v_arrayElimArr_4 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_1808 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_4 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< (+ .cse1 9223372036854775808) 0) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_245| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1805)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1808) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 9223372036854775809 .cse1))))) (not (<= (+ |c_ULTIMATE.start_main_#t~post9#1| 1) |v_ULTIMATE.start_main_~i~0#1_245|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 1 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |c_ULTIMATE.start_main_~#sum~0#1.base|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (<= 0 |c_ULTIMATE.start_main_#t~post9#1|) (= (select .cse2 0) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)))) is different from false [2022-10-16 10:48:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:38,151 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2022-10-16 10:48:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-10-16 10:48:38,152 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.261904761904762) internal successors, (137), 43 states have internal predecessors, (137), 0 states have call successors, (0), 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:48:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:38,153 INFO L225 Difference]: With dead ends: 248 [2022-10-16 10:48:38,153 INFO L226 Difference]: Without dead ends: 246 [2022-10-16 10:48:38,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 85 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1617 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=693, Invalid=5031, Unknown=8, NotChecked=1240, Total=6972 [2022-10-16 10:48:38,157 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 546 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 827 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:38,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 818 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 874 Invalid, 0 Unknown, 827 Unchecked, 0.8s Time] [2022-10-16 10:48:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-10-16 10:48:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 179. [2022-10-16 10:48:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 167 states have (on average 1.2275449101796407) internal successors, (205), 178 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have 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:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2022-10-16 10:48:38,198 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 52 [2022-10-16 10:48:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:38,198 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2022-10-16 10:48:38,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.261904761904762) internal successors, (137), 43 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have 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:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2022-10-16 10:48:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 10:48:38,199 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:38,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:38,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-10-16 10:48:38,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:38,413 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:48:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash -754140411, now seen corresponding path program 2 times [2022-10-16 10:48:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:38,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009330147] [2022-10-16 10:48:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:48:41,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:41,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009330147] [2022-10-16 10:48:41,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009330147] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:41,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462869671] [2022-10-16 10:48:41,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:41,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:41,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:41,992 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:48:41,993 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:48:42,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:48:42,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:42,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 84 conjunts are in the unsatisfiable core [2022-10-16 10:48:42,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:42,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:42,154 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-10-16 10:48:42,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 39 [2022-10-16 10:48:42,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:48:42,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-16 10:48:42,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:42,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-10-16 10:48:43,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-10-16 10:48:43,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2022-10-16 10:48:44,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2022-10-16 10:48:44,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2022-10-16 10:48:44,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:48:44,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:44,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-10-16 10:48:45,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:45,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:45,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-10-16 10:48:46,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:46,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:46,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:48:46,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-10-16 10:48:46,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:46,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:46,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:48:46,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 24 [2022-10-16 10:48:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:48:46,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:16,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_250| Int) (v_ArrVal_1899 Int) (v_ArrVal_1901 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1897))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< |v_ULTIMATE.start_main_~i~0#1_250| 1) (< (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1899) (< (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1899)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1899) v_ArrVal_1901) (< (+ v_ArrVal_1903 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1903)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) 9223372036854775808) (< (+ v_ArrVal_1901 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1903) (not (< |v_ULTIMATE.start_main_~i~0#1_250| c_~N~0)))))) is different from false [2022-10-16 10:49:27,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int) (v_ArrVal_1899 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1894)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1897))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1894 1)) (< |v_ULTIMATE.start_main_~i~0#1_250| 1) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1899) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1899)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1899) v_ArrVal_1901) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1903)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1903) 9223372036854775808) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1901) v_ArrVal_1903) (not (< |v_ULTIMATE.start_main_~i~0#1_250| c_~N~0)))))) is different from false [2022-10-16 10:49:34,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int) (v_ArrVal_1899 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_1893) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1894)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1897))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1899)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1899) v_ArrVal_1901) (< (+ v_ArrVal_1901 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1903) (not (<= v_ArrVal_1894 1)) (< |v_ULTIMATE.start_main_~i~0#1_250| 1) (< (+ v_ArrVal_1903 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1903)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) 9223372036854775808) (< |c_ULTIMATE.start_main_#t~post8#1| |v_ULTIMATE.start_main_~i~0#1_250|) (not (<= v_ArrVal_1893 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1899))))) is different from false [2022-10-16 10:49:34,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int) (v_ArrVal_1899 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_1893) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1894)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1897))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1899)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1899) v_ArrVal_1901) (< (+ v_ArrVal_1901 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1903) (not (<= v_ArrVal_1894 1)) (< |v_ULTIMATE.start_main_~i~0#1_250| 1) (< (+ v_ArrVal_1903 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1903)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) 9223372036854775808) (not (<= v_ArrVal_1893 1)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1899) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_250|))))) is different from false [2022-10-16 10:49:37,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int) (v_ArrVal_1899 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (store (let ((.cse2 (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_#t~post8#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_1893) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1894))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1897))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ |c_ULTIMATE.start_main_#t~post8#1| 1) |v_ULTIMATE.start_main_~i~0#1_250|) (not (<= v_ArrVal_1894 1)) (< |v_ULTIMATE.start_main_~i~0#1_250| 1) (< (+ v_ArrVal_1903 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1903)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) 9223372036854775808) (not (<= v_ArrVal_1893 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1899)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1899) v_ArrVal_1901) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1901) v_ArrVal_1903) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1899))))) is different from false [2022-10-16 10:49:38,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int) (v_ArrVal_1899 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (store (let ((.cse2 (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| 4) 1)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_1893) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1894))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1897))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_1894 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1901) v_ArrVal_1903) (< (+ v_ArrVal_1903 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1903)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|))) 9223372036854775808) (< |v_ULTIMATE.start_main_~i~0#1_250| 1) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_250|) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_1899) (not (<= v_ArrVal_1893 1)) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1899)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1899) v_ArrVal_1901))))) is different from false [2022-10-16 10:49:38,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1903 Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1893 Int) (v_ArrVal_1894 Int) (|v_ULTIMATE.start_main_~i~0#1_250| Int) (v_ArrVal_1899 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) 1))))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_1893) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_1894))) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_1897))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1903)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_250| 4) |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1903) 9223372036854775808) (< (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1899)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) v_ArrVal_1899) v_ArrVal_1901) (not (<= v_ArrVal_1894 1)) (< |v_ULTIMATE.start_main_~i~0#1_250| 1) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1899) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_250|) (< (+ v_ArrVal_1901 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) v_ArrVal_1903) (not (<= v_ArrVal_1893 1)))))) is different from false [2022-10-16 10:49:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 11 refuted. 1 times theorem prover too weak. 1 trivial. 15 not checked. [2022-10-16 10:49:38,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462869671] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:38,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:38,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 81 [2022-10-16 10:49:38,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580248728] [2022-10-16 10:49:38,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:38,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-10-16 10:49:38,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:38,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-10-16 10:49:38,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=4974, Unknown=208, NotChecked=1064, Total=6642 [2022-10-16 10:49:38,323 INFO L87 Difference]: Start difference. First operand 179 states and 205 transitions. Second operand has 82 states, 81 states have (on average 2.0123456790123457) internal successors, (163), 82 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:03,710 INFO L93 Difference]: Finished difference Result 199 states and 231 transitions. [2022-10-16 10:50:03,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-10-16 10:50:03,710 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 2.0123456790123457) internal successors, (163), 82 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-10-16 10:50:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:03,712 INFO L225 Difference]: With dead ends: 199 [2022-10-16 10:50:03,712 INFO L226 Difference]: Without dead ends: 198 [2022-10-16 10:50:03,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 121 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3485 ImplicationChecksByTransitivity, 77.6s TimeCoverageRelationStatistics Valid=1149, Invalid=11985, Unknown=234, NotChecked=1638, Total=15006 [2022-10-16 10:50:03,715 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 253 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1714 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:03,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 999 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 954 Invalid, 0 Unknown, 1714 Unchecked, 0.9s Time] [2022-10-16 10:50:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-10-16 10:50:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 193. [2022-10-16 10:50:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 181 states have (on average 1.2430939226519337) internal successors, (225), 192 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2022-10-16 10:50:03,751 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 57 [2022-10-16 10:50:03,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:03,751 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2022-10-16 10:50:03,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 2.0123456790123457) internal successors, (163), 82 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2022-10-16 10:50:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 10:50:03,752 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:03,753 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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:50:03,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-10-16 10:50:03,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-10-16 10:50:03,966 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:50:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:03,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2006695881, now seen corresponding path program 4 times [2022-10-16 10:50:03,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:03,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362301879] [2022-10-16 10:50:03,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:03,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-10-16 10:50:04,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:04,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362301879] [2022-10-16 10:50:04,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362301879] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:04,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821759681] [2022-10-16 10:50:04,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:50:04,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:04,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:04,167 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:50:04,189 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:50:04,326 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:50:04,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:04,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:50:04,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-10-16 10:50:04,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-10-16 10:50:04,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821759681] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:04,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:04,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:50:04,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458225837] [2022-10-16 10:50:04,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:04,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:50:04,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:04,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:50:04,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:50:04,674 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:05,126 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2022-10-16 10:50:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-16 10:50:05,126 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-10-16 10:50:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:05,128 INFO L225 Difference]: With dead ends: 295 [2022-10-16 10:50:05,128 INFO L226 Difference]: Without dead ends: 212 [2022-10-16 10:50:05,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 96 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2022-10-16 10:50:05,129 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 189 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:05,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 467 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:50:05,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-10-16 10:50:05,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 197. [2022-10-16 10:50:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 185 states have (on average 1.2378378378378379) internal successors, (229), 196 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2022-10-16 10:50:05,168 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 57 [2022-10-16 10:50:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:05,169 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2022-10-16 10:50:05,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2022-10-16 10:50:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 10:50:05,170 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:05,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:05,193 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:50:05,374 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,SelfDestructingSolverStorable37 [2022-10-16 10:50:05,374 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:50:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1903516129, now seen corresponding path program 1 times [2022-10-16 10:50:05,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:05,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574963865] [2022-10-16 10:50:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:50:06,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:06,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574963865] [2022-10-16 10:50:06,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574963865] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:06,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312849343] [2022-10-16 10:50:06,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:06,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:06,337 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:50:06,339 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:50:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:06,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjunts are in the unsatisfiable core [2022-10-16 10:50:06,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:06,487 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 96 treesize of output 94 [2022-10-16 10:50:06,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:50:06,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:50:06,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-16 10:50:06,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-10-16 10:50:06,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-10-16 10:50:07,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:50:07,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-10-16 10:50:07,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:50:07,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:50:07,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-10-16 10:50:07,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:50:07,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 10:50:07,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:50:07,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2022-10-16 10:50:07,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:50:07,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2022-10-16 10:50:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:50:07,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:10,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:10,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2022-10-16 10:50:10,279 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_arrayElimArr_6 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (not (= v_arrayElimArr_6 (store v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset| .cse0))) (< .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse0)) (< 0 (+ .cse1 9223372036854775809 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ 9223372036854775808 .cse0) 0)))) is different from false [2022-10-16 10:50:10,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_2052 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_6 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2052))) (or (not (= v_arrayElimArr_6 (store v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset| .cse0))) (< .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse0)) (< (+ 9223372036854775808 .cse0) 0) (< 0 (+ .cse1 9223372036854775809 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) is different from false [2022-10-16 10:50:10,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2049 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_2052 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_2049)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2052)) (.cse2 (select v_arrayElimArr_6 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ .cse0 9223372036854775809 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2)) (not (= v_arrayElimArr_6 (store v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset| .cse2))) (not (<= 1 v_ArrVal_2049)) (< (+ 9223372036854775808 .cse2) 0)))) is different from false [2022-10-16 10:50:10,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2049 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_2052 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_6 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post9#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_2049)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2052))) (or (< .cse0 (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (= v_arrayElimArr_6 (store v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset| .cse1))) (not (<= 1 v_ArrVal_2049)) (< (+ 9223372036854775808 .cse1) 0) (< 0 (+ .cse0 9223372036854775809 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) is different from false [2022-10-16 10:50:10,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2049 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_2052 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_2049)) |c_ULTIMATE.start_main_~c~0#1.base| v_ArrVal_2052)) (.cse2 (select v_arrayElimArr_6 |ULTIMATE.start_main_~#sum~0#1.offset|))) (or (< 0 (+ .cse0 9223372036854775809 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_7) |c_ULTIMATE.start_main_~b~0#1.base|) (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_6) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse2)) (not (= v_arrayElimArr_6 (store v_arrayElimArr_7 |ULTIMATE.start_main_~#sum~0#1.offset| .cse2))) (not (<= 1 v_ArrVal_2049)) (< (+ 9223372036854775808 .cse2) 0)))) is different from false [2022-10-16 10:50:10,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:10,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 65 [2022-10-16 10:50:10,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:10,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 195 [2022-10-16 10:50:10,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2022-10-16 10:50:10,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:50:10,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 151 [2022-10-16 10:50:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 15 not checked. [2022-10-16 10:50:11,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312849343] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:11,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:11,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 44 [2022-10-16 10:50:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559205784] [2022-10-16 10:50:11,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:11,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-16 10:50:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:11,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-16 10:50:11,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1401, Unknown=6, NotChecked=400, Total=1980 [2022-10-16 10:50:11,308 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand has 45 states, 44 states have (on average 3.5454545454545454) internal successors, (156), 45 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:50:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:14,109 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2022-10-16 10:50:14,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-16 10:50:14,109 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.5454545454545454) internal successors, (156), 45 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-10-16 10:50:14,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:14,110 INFO L225 Difference]: With dead ends: 237 [2022-10-16 10:50:14,110 INFO L226 Difference]: Without dead ends: 236 [2022-10-16 10:50:14,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 93 SyntacticMatches, 12 SemanticMatches, 69 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=634, Invalid=3670, Unknown=6, NotChecked=660, Total=4970 [2022-10-16 10:50:14,112 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 523 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 863 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:14,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 760 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 831 Invalid, 0 Unknown, 863 Unchecked, 0.7s Time] [2022-10-16 10:50:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-10-16 10:50:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 200. [2022-10-16 10:50:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 188 states have (on average 1.2393617021276595) internal successors, (233), 199 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have 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:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 233 transitions. [2022-10-16 10:50:14,148 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 233 transitions. Word has length 58 [2022-10-16 10:50:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:14,148 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 233 transitions. [2022-10-16 10:50:14,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.5454545454545454) internal successors, (156), 45 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:50:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 233 transitions. [2022-10-16 10:50:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-16 10:50:14,149 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:14,149 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:14,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-10-16 10:50:14,350 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,SelfDestructingSolverStorable38 [2022-10-16 10:50:14,350 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:50:14,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1120494805, now seen corresponding path program 2 times [2022-10-16 10:50:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:14,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853496647] [2022-10-16 10:50:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 10:50:14,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:14,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853496647] [2022-10-16 10:50:14,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853496647] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:14,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204694055] [2022-10-16 10:50:14,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:50:14,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:14,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:14,489 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:14,490 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:14,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:50:14,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:14,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:50:14,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 10:50:14,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-16 10:50:14,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204694055] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:14,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:14,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:50:14,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115385083] [2022-10-16 10:50:14,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:14,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:50:14,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:14,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:50:14,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:50:14,908 INFO L87 Difference]: Start difference. First operand 200 states and 233 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:15,239 INFO L93 Difference]: Finished difference Result 242 states and 277 transitions. [2022-10-16 10:50:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 10:50:15,240 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-10-16 10:50:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:15,241 INFO L225 Difference]: With dead ends: 242 [2022-10-16 10:50:15,241 INFO L226 Difference]: Without dead ends: 209 [2022-10-16 10:50:15,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2022-10-16 10:50:15,243 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 196 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:15,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 312 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:50:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-10-16 10:50:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 200. [2022-10-16 10:50:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 188 states have (on average 1.2234042553191489) internal successors, (230), 199 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have 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:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 230 transitions. [2022-10-16 10:50:15,281 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 230 transitions. Word has length 59 [2022-10-16 10:50:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:15,282 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 230 transitions. [2022-10-16 10:50:15,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 230 transitions. [2022-10-16 10:50:15,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-16 10:50:15,283 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:15,283 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-10-16 10:50:15,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-10-16 10:50:15,494 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,SelfDestructingSolverStorable39 [2022-10-16 10:50:15,494 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:50:15,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash 377072417, now seen corresponding path program 1 times [2022-10-16 10:50:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:15,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872027929] [2022-10-16 10:50:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:15,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 10:50:15,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:15,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872027929] [2022-10-16 10:50:15,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872027929] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:15,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632577470] [2022-10-16 10:50:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:15,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:15,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:15,587 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:15,617 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:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:15,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:50:15,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 10:50:15,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 10:50:15,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632577470] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:15,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:15,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:50:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891548855] [2022-10-16 10:50:15,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:15,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:50:15,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:15,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:50:15,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:50:15,811 INFO L87 Difference]: Start difference. First operand 200 states and 230 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 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:50:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:16,000 INFO L93 Difference]: Finished difference Result 241 states and 279 transitions. [2022-10-16 10:50:16,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:50:16,000 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 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 60 [2022-10-16 10:50:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:16,001 INFO L225 Difference]: With dead ends: 241 [2022-10-16 10:50:16,001 INFO L226 Difference]: Without dead ends: 240 [2022-10-16 10:50:16,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 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:50:16,002 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 126 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:16,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 172 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:50:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-10-16 10:50:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 223. [2022-10-16 10:50:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 211 states have (on average 1.2559241706161137) internal successors, (265), 222 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have 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:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 265 transitions. [2022-10-16 10:50:16,046 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 265 transitions. Word has length 60 [2022-10-16 10:50:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:16,046 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 265 transitions. [2022-10-16 10:50:16,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 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:50:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 265 transitions. [2022-10-16 10:50:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 10:50:16,047 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:16,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-10-16 10:50:16,084 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:16,261 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,SelfDestructingSolverStorable40 [2022-10-16 10:50:16,261 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:50:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:16,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1195656823, now seen corresponding path program 1 times [2022-10-16 10:50:16,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:16,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991473086] [2022-10-16 10:50:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 10:50:16,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:16,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991473086] [2022-10-16 10:50:16,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991473086] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:16,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756265185] [2022-10-16 10:50:16,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:16,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:16,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:16,347 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:16,348 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:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:16,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:50:16,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-16 10:50:16,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:50:16,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756265185] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:50:16,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:50:16,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:50:16,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233526936] [2022-10-16 10:50:16,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:50:16,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:50:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:16,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:50:16,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:50:16,531 INFO L87 Difference]: Start difference. First operand 223 states and 265 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 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:50:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:16,633 INFO L93 Difference]: Finished difference Result 226 states and 265 transitions. [2022-10-16 10:50:16,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:50:16,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 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 61 [2022-10-16 10:50:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:16,634 INFO L225 Difference]: With dead ends: 226 [2022-10-16 10:50:16,634 INFO L226 Difference]: Without dead ends: 225 [2022-10-16 10:50:16,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 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:50:16,635 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 35 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:16,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 165 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:50:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-10-16 10:50:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2022-10-16 10:50:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 211 states have (on average 1.2274881516587677) internal successors, (259), 221 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have 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:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 259 transitions. [2022-10-16 10:50:16,666 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 259 transitions. Word has length 61 [2022-10-16 10:50:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:16,666 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 259 transitions. [2022-10-16 10:50:16,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 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:50:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 259 transitions. [2022-10-16 10:50:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 10:50:16,667 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:16,667 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:16,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-10-16 10:50:16,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:16,877 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-10-16 10:50:16,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1696907333, now seen corresponding path program 5 times [2022-10-16 10:50:16,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:16,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419858926] [2022-10-16 10:50:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:16,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat