/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/s12iff.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 10:47:28,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 10:47:28,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 10:47:28,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 10:47:28,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 10:47:28,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 10:47:28,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 10:47:28,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 10:47:28,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 10:47:28,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 10:47:28,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 10:47:28,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 10:47:28,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 10:47:28,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 10:47:28,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 10:47:28,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 10:47:28,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 10:47:28,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 10:47:28,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 10:47:28,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 10:47:28,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 10:47:28,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 10:47:28,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 10:47:28,927 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 10:47:28,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 10:47:28,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 10:47:28,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 10:47:28,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 10:47:28,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 10:47:28,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 10:47:28,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 10:47:28,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 10:47:28,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 10:47:28,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 10:47:28,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 10:47:28,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 10:47:28,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 10:47:28,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 10:47:28,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 10:47:28,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 10:47:28,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 10:47:28,953 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:47:29,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 10:47:29,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 10:47:29,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 10:47:29,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 10:47:29,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 10:47:29,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 10:47:29,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 10:47:29,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 10:47:29,019 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 10:47:29,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 10:47:29,020 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 10:47:29,020 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 10:47:29,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 10:47:29,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 10:47:29,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 10:47:29,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 10:47:29,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 10:47:29,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 10:47:29,022 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 10:47:29,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 10:47:29,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 10:47:29,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 10:47:29,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 10:47:29,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 10:47:29,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 10:47:29,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 10:47:29,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:47:29,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 10:47:29,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 10:47:29,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 10:47:29,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 10:47:29,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 10:47:29,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 10:47:29,025 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:47:29,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 10:47:29,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 10:47:29,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 10:47:29,470 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 10:47:29,470 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 10:47:29,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s12iff.c [2022-10-16 10:47:29,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfa99bbc4/46f93ffe015b40ff8e81aa399114f461/FLAG50bbf4592 [2022-10-16 10:47:30,275 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 10:47:30,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s12iff.c [2022-10-16 10:47:30,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfa99bbc4/46f93ffe015b40ff8e81aa399114f461/FLAG50bbf4592 [2022-10-16 10:47:30,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfa99bbc4/46f93ffe015b40ff8e81aa399114f461 [2022-10-16 10:47:30,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 10:47:30,666 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 10:47:30,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 10:47:30,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 10:47:30,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 10:47:30,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:47:30" (1/1) ... [2022-10-16 10:47:30,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6b6a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:30, skipping insertion in model container [2022-10-16 10:47:30,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 10:47:30" (1/1) ... [2022-10-16 10:47:30,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 10:47:30,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 10:47:30,925 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/s12iff.c[589,602] [2022-10-16 10:47:30,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:47:30,961 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 10:47:30,975 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/s12iff.c[589,602] [2022-10-16 10:47:30,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 10:47:31,005 INFO L208 MainTranslator]: Completed translation [2022-10-16 10:47:31,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31 WrapperNode [2022-10-16 10:47:31,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 10:47:31,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 10:47:31,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 10:47:31,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 10:47:31,017 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:47:31" (1/1) ... [2022-10-16 10:47:31,026 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:47:31" (1/1) ... [2022-10-16 10:47:31,054 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2022-10-16 10:47:31,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 10:47:31,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 10:47:31,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 10:47:31,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 10:47:31,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31" (1/1) ... [2022-10-16 10:47:31,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31" (1/1) ... [2022-10-16 10:47:31,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31" (1/1) ... [2022-10-16 10:47:31,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31" (1/1) ... [2022-10-16 10:47:31,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31" (1/1) ... [2022-10-16 10:47:31,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31" (1/1) ... [2022-10-16 10:47:31,085 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31" (1/1) ... [2022-10-16 10:47:31,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31" (1/1) ... [2022-10-16 10:47:31,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 10:47:31,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 10:47:31,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 10:47:31,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 10:47:31,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31" (1/1) ... [2022-10-16 10:47:31,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 10:47:31,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:31,136 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:47:31,156 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:47:31,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 10:47:31,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 10:47:31,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 10:47:31,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 10:47:31,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 10:47:31,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 10:47:31,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 10:47:31,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 10:47:31,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 10:47:31,362 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 10:47:31,365 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 10:47:31,677 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 10:47:31,698 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 10:47:31,699 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 10:47:31,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:47:31 BoogieIcfgContainer [2022-10-16 10:47:31,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 10:47:31,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 10:47:31,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 10:47:31,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 10:47:31,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 10:47:30" (1/3) ... [2022-10-16 10:47:31,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa2a431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:47:31, skipping insertion in model container [2022-10-16 10:47:31,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 10:47:31" (2/3) ... [2022-10-16 10:47:31,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa2a431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 10:47:31, skipping insertion in model container [2022-10-16 10:47:31,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 10:47:31" (3/3) ... [2022-10-16 10:47:31,733 INFO L112 eAbstractionObserver]: Analyzing ICFG s12iff.c [2022-10-16 10:47:31,778 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 10:47:31,779 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-16 10:47:31,840 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 10:47:31,849 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;@2c331322, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 10:47:31,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-16 10:47:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:47:31,863 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:31,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:31,865 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash 177631151, now seen corresponding path program 1 times [2022-10-16 10:47:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:31,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937666591] [2022-10-16 10:47:31,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:32,062 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:47:32,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:32,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937666591] [2022-10-16 10:47:32,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937666591] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:32,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:32,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 10:47:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74987035] [2022-10-16 10:47:32,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:32,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 10:47:32,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:32,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 10:47:32,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 10:47:32,113 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:32,136 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2022-10-16 10:47:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 10:47:32,139 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:47:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:32,149 INFO L225 Difference]: With dead ends: 104 [2022-10-16 10:47:32,149 INFO L226 Difference]: Without dead ends: 48 [2022-10-16 10:47:32,153 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:47:32,158 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:32,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:47:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-16 10:47:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-16 10:47:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.625) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-10-16 10:47:32,200 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 8 [2022-10-16 10:47:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:32,201 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-10-16 10:47:32,201 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:47:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-10-16 10:47:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 10:47:32,202 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:32,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:32,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 10:47:32,203 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:32,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:32,204 INFO L85 PathProgramCache]: Analyzing trace with hash 179478193, now seen corresponding path program 1 times [2022-10-16 10:47:32,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:32,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055935223] [2022-10-16 10:47:32,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:32,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:32,407 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:47:32,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:32,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055935223] [2022-10-16 10:47:32,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055935223] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:32,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:32,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:47:32,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641269038] [2022-10-16 10:47:32,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:32,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:47:32,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:47:32,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:47:32,412 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:32,519 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-10-16 10:47:32,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:47:32,520 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:47:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:32,522 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:47:32,523 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 10:47:32,523 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:32,525 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:32,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 97 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 10:47:32,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2022-10-16 10:47:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-10-16 10:47:32,537 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 8 [2022-10-16 10:47:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:32,537 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-10-16 10:47:32,538 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:47:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-10-16 10:47:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 10:47:32,539 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:32,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:32,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 10:47:32,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:32,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash 678258903, now seen corresponding path program 1 times [2022-10-16 10:47:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:32,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002870608] [2022-10-16 10:47:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:32,658 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:47:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:32,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002870608] [2022-10-16 10:47:32,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002870608] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:32,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:32,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:47:32,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097055558] [2022-10-16 10:47:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:32,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:47:32,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:32,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:47:32,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:47:32,664 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:32,796 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-10-16 10:47:32,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:47:32,798 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:47:32,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:32,802 INFO L225 Difference]: With dead ends: 118 [2022-10-16 10:47:32,802 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:47:32,803 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:47:32,806 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 81 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:32,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:47:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 52. [2022-10-16 10:47:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-10-16 10:47:32,827 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2022-10-16 10:47:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:32,828 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-10-16 10:47:32,828 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:47:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-10-16 10:47:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 10:47:32,829 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:32,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:32,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 10:47:32,830 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:32,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash 504169901, now seen corresponding path program 1 times [2022-10-16 10:47:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:32,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706521385] [2022-10-16 10:47:32,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:32,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:33,004 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:47:33,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:33,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706521385] [2022-10-16 10:47:33,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706521385] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:33,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386107100] [2022-10-16 10:47:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:33,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:33,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:33,008 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:47:33,029 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:47:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:33,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:47:33,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:33,153 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:47:33,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:33,206 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:47:33,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386107100] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:33,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:33,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:47:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837368544] [2022-10-16 10:47:33,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:33,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:47:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:47:33,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:47:33,210 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:33,414 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-10-16 10:47:33,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:47:33,415 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:47:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:33,418 INFO L225 Difference]: With dead ends: 99 [2022-10-16 10:47:33,418 INFO L226 Difference]: Without dead ends: 98 [2022-10-16 10:47:33,420 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:47:33,422 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 89 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:33,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 157 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:33,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-16 10:47:33,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2022-10-16 10:47:33,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.5) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2022-10-16 10:47:33,435 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 12 [2022-10-16 10:47:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:33,435 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2022-10-16 10:47:33,436 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:47:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2022-10-16 10:47:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 10:47:33,437 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:33,437 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:33,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 10:47:33,652 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:47:33,653 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1550602195, now seen corresponding path program 1 times [2022-10-16 10:47:33,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:33,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954876874] [2022-10-16 10:47:33,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:33,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:33,762 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:47:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:33,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954876874] [2022-10-16 10:47:33,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954876874] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:33,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712855437] [2022-10-16 10:47:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:33,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:33,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:33,768 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:47:33,776 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:47:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:33,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:47:33,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:33,866 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:47:33,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:47:33,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712855437] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:33,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:47:33,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:47:33,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79767474] [2022-10-16 10:47:33,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:33,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:47:33,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:33,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:47:33,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:47:33,870 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:33,967 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-10-16 10:47:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:47:33,968 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:47:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:33,970 INFO L225 Difference]: With dead ends: 91 [2022-10-16 10:47:33,970 INFO L226 Difference]: Without dead ends: 90 [2022-10-16 10:47:33,970 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:47:33,972 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 40 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:33,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 110 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-16 10:47:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2022-10-16 10:47:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.4375) internal successors, (69), 61 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-10-16 10:47:33,982 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 13 [2022-10-16 10:47:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:33,986 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-10-16 10:47:33,986 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:47:33,986 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-10-16 10:47:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:47:33,987 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:33,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:34,028 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:47:34,188 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:47:34,189 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash -825622317, now seen corresponding path program 1 times [2022-10-16 10:47:34,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:34,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661888186] [2022-10-16 10:47:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:34,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:34,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:34,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661888186] [2022-10-16 10:47:34,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661888186] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:34,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557933298] [2022-10-16 10:47:34,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:34,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:34,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:34,587 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:47:34,609 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:47:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:34,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-16 10:47:34,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:34,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-10-16 10:47:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:34,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:34,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-10-16 10:47:34,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-10-16 10:47:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:34,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557933298] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:34,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:34,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-10-16 10:47:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562123833] [2022-10-16 10:47:34,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:34,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 10:47:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 10:47:34,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-10-16 10:47:34,850 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:34,983 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2022-10-16 10:47:34,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 10:47:34,983 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-16 10:47:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:34,985 INFO L225 Difference]: With dead ends: 121 [2022-10-16 10:47:34,985 INFO L226 Difference]: Without dead ends: 86 [2022-10-16 10:47:34,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:47:34,987 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:34,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 205 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-16 10:47:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2022-10-16 10:47:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 62 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-10-16 10:47:34,996 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 14 [2022-10-16 10:47:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:34,996 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-10-16 10:47:34,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-10-16 10:47:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 10:47:34,998 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:34,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:35,037 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:47:35,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:35,203 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:35,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:35,204 INFO L85 PathProgramCache]: Analyzing trace with hash -825622509, now seen corresponding path program 1 times [2022-10-16 10:47:35,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:35,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020530722] [2022-10-16 10:47:35,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:35,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:35,261 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:47:35,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:35,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020530722] [2022-10-16 10:47:35,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020530722] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:35,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:35,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:47:35,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951046544] [2022-10-16 10:47:35,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:35,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:47:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:35,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:47:35,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:47:35,267 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:35,308 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-10-16 10:47:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:47:35,309 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:47:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:35,310 INFO L225 Difference]: With dead ends: 63 [2022-10-16 10:47:35,310 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 10:47:35,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:47:35,311 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:35,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:47:35,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 10:47:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-16 10:47:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-10-16 10:47:35,319 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2022-10-16 10:47:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:35,320 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-10-16 10:47:35,320 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:47:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-10-16 10:47:35,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 10:47:35,321 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:35,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:35,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 10:47:35,321 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:35,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1157615292, now seen corresponding path program 1 times [2022-10-16 10:47:35,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:35,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97238679] [2022-10-16 10:47:35,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:35,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:35,378 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:47:35,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:35,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97238679] [2022-10-16 10:47:35,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97238679] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:35,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:35,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:47:35,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864769903] [2022-10-16 10:47:35,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:35,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:47:35,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:35,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:47:35,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:47:35,381 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:35,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:35,437 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-10-16 10:47:35,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:47:35,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 10:47:35,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:35,439 INFO L225 Difference]: With dead ends: 82 [2022-10-16 10:47:35,439 INFO L226 Difference]: Without dead ends: 80 [2022-10-16 10:47:35,440 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:35,441 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:35,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 92 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:47:35,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-16 10:47:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-10-16 10:47:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 65 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-10-16 10:47:35,449 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2022-10-16 10:47:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:35,450 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-10-16 10:47:35,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-10-16 10:47:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-16 10:47:35,451 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:35,451 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:35,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 10:47:35,452 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:35,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:35,452 INFO L85 PathProgramCache]: Analyzing trace with hash 250320491, now seen corresponding path program 1 times [2022-10-16 10:47:35,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:35,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241555243] [2022-10-16 10:47:35,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:35,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:35,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241555243] [2022-10-16 10:47:35,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241555243] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:35,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871211532] [2022-10-16 10:47:35,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:35,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:35,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:35,608 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:47:35,627 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:47:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:35,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:47:35,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:35,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:35,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871211532] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:35,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:35,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-10-16 10:47:35,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188198267] [2022-10-16 10:47:35,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:35,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 10:47:35,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:35,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 10:47:35,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-10-16 10:47:35,844 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:36,091 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-10-16 10:47:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 10:47:36,092 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-16 10:47:36,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:36,093 INFO L225 Difference]: With dead ends: 155 [2022-10-16 10:47:36,093 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 10:47:36,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:47:36,095 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 113 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:36,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 307 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:47:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 10:47:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2022-10-16 10:47:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.356164383561644) internal successors, (99), 84 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:36,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2022-10-16 10:47:36,105 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 21 [2022-10-16 10:47:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:36,106 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2022-10-16 10:47:36,106 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:47:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2022-10-16 10:47:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:47:36,107 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:36,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:36,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 10:47:36,323 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:47:36,324 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash 38416049, now seen corresponding path program 1 times [2022-10-16 10:47:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:36,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232671346] [2022-10-16 10:47:36,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:36,343 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:47:36,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903897032] [2022-10-16 10:47:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:36,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:36,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:36,345 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:47:36,369 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:47:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:36,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-16 10:47:36,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:36,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-10-16 10:47:36,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 10:47:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:47:36,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:36,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-10-16 10:47:36,631 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-16 10:47:36,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2022-10-16 10:47:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:47:36,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:36,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232671346] [2022-10-16 10:47:36,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:47:36,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903897032] [2022-10-16 10:47:36,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903897032] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:36,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:47:36,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-10-16 10:47:36,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991657546] [2022-10-16 10:47:36,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:36,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:47:36,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:36,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:47:36,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:47:36,649 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:36,941 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2022-10-16 10:47:36,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:47:36,942 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 10:47:36,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:36,943 INFO L225 Difference]: With dead ends: 153 [2022-10-16 10:47:36,943 INFO L226 Difference]: Without dead ends: 126 [2022-10-16 10:47:36,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:47:36,945 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 94 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:36,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 319 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:47:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-10-16 10:47:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2022-10-16 10:47:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 96 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2022-10-16 10:47:36,955 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 23 [2022-10-16 10:47:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:36,956 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2022-10-16 10:47:36,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-10-16 10:47:36,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 10:47:36,957 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:36,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:36,996 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:47:37,171 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:47:37,172 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:37,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:37,173 INFO L85 PathProgramCache]: Analyzing trace with hash 38415857, now seen corresponding path program 1 times [2022-10-16 10:47:37,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:37,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753185124] [2022-10-16 10:47:37,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:37,385 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:47:37,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:37,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753185124] [2022-10-16 10:47:37,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753185124] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:37,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:37,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 10:47:37,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210776406] [2022-10-16 10:47:37,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:37,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:47:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:37,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:47:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 10:47:37,388 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:37,459 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-10-16 10:47:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 10:47:37,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 10:47:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:37,461 INFO L225 Difference]: With dead ends: 108 [2022-10-16 10:47:37,461 INFO L226 Difference]: Without dead ends: 106 [2022-10-16 10:47:37,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 10:47:37,462 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:37,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 115 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-16 10:47:37,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-10-16 10:47:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 101 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2022-10-16 10:47:37,472 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 23 [2022-10-16 10:47:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:37,472 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2022-10-16 10:47:37,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-10-16 10:47:37,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 10:47:37,474 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:37,474 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:37,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 10:47:37,475 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash -897513823, now seen corresponding path program 2 times [2022-10-16 10:47:37,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:37,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883390501] [2022-10-16 10:47:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:37,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:37,620 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:47:37,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:37,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883390501] [2022-10-16 10:47:37,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883390501] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:37,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401849377] [2022-10-16 10:47:37,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:47:37,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:37,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:37,623 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:47:37,642 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:47:37,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:47:37,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:37,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:47:37,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:37,738 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:47:37,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:37,783 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:47:37,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401849377] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:37,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:37,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:47:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105692856] [2022-10-16 10:47:37,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:37,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:47:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:37,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:47:37,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:47:37,786 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:38,053 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2022-10-16 10:47:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:47:38,054 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:47:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:38,055 INFO L225 Difference]: With dead ends: 124 [2022-10-16 10:47:38,055 INFO L226 Difference]: Without dead ends: 123 [2022-10-16 10:47:38,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:47:38,058 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 206 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:38,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 170 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-10-16 10:47:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 91. [2022-10-16 10:47:38,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 90 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 108 transitions. [2022-10-16 10:47:38,071 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 108 transitions. Word has length 24 [2022-10-16 10:47:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:38,072 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 108 transitions. [2022-10-16 10:47:38,072 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:47:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 108 transitions. [2022-10-16 10:47:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-16 10:47:38,075 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:38,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:38,116 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:47:38,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:38,290 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:38,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1920559343, now seen corresponding path program 2 times [2022-10-16 10:47:38,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:38,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216072425] [2022-10-16 10:47:38,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:38,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:38,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216072425] [2022-10-16 10:47:38,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216072425] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:38,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068620862] [2022-10-16 10:47:38,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:47:38,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:38,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:38,752 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:47:38,763 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:47:38,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:47:38,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:38,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 10:47:38,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:38,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:47:38,922 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:47:38,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:47:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:38,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:39,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-10-16 10:47:39,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:47:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:39,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068620862] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:39,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:39,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2022-10-16 10:47:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678342024] [2022-10-16 10:47:39,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:39,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 10:47:39,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:39,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 10:47:39,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-10-16 10:47:39,060 INFO L87 Difference]: Start difference. First operand 91 states and 108 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:39,343 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2022-10-16 10:47:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:47:39,343 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-16 10:47:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:39,344 INFO L225 Difference]: With dead ends: 156 [2022-10-16 10:47:39,345 INFO L226 Difference]: Without dead ends: 120 [2022-10-16 10:47:39,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:47:39,346 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:39,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 317 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:47:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-16 10:47:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2022-10-16 10:47:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 92 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-10-16 10:47:39,355 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 25 [2022-10-16 10:47:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:39,355 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-10-16 10:47:39,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-10-16 10:47:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 10:47:39,356 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:39,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:39,401 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:47:39,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:39,571 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:39,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:39,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1985602653, now seen corresponding path program 1 times [2022-10-16 10:47:39,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:39,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460219248] [2022-10-16 10:47:39,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:39,657 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:47:39,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:39,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460219248] [2022-10-16 10:47:39,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460219248] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:39,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 10:47:39,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 10:47:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760330700] [2022-10-16 10:47:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:39,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 10:47:39,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 10:47:39,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 10:47:39,660 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:39,719 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2022-10-16 10:47:39,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 10:47:39,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-16 10:47:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:39,721 INFO L225 Difference]: With dead ends: 105 [2022-10-16 10:47:39,721 INFO L226 Difference]: Without dead ends: 103 [2022-10-16 10:47:39,723 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:39,724 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:39,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 99 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 10:47:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-10-16 10:47:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-10-16 10:47:39,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 100 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-10-16 10:47:39,734 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 26 [2022-10-16 10:47:39,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:39,734 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-10-16 10:47:39,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-10-16 10:47:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-16 10:47:39,739 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:39,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:39,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 10:47:39,740 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2118394144, now seen corresponding path program 1 times [2022-10-16 10:47:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:39,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355656227] [2022-10-16 10:47:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:47:39,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:39,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355656227] [2022-10-16 10:47:39,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355656227] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:39,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293276436] [2022-10-16 10:47:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:39,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:39,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:39,868 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:47:39,885 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:47:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:39,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:47:39,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:39,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:47:39,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:47:40,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293276436] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:40,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:40,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:47:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988231261] [2022-10-16 10:47:40,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:40,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:47:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:47:40,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:47:40,031 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:40,210 INFO L93 Difference]: Finished difference Result 148 states and 178 transitions. [2022-10-16 10:47:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:47:40,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-16 10:47:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:40,213 INFO L225 Difference]: With dead ends: 148 [2022-10-16 10:47:40,213 INFO L226 Difference]: Without dead ends: 147 [2022-10-16 10:47:40,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:47:40,217 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 68 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:40,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 152 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-10-16 10:47:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2022-10-16 10:47:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 131 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 165 transitions. [2022-10-16 10:47:40,229 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 165 transitions. Word has length 28 [2022-10-16 10:47:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:40,231 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 165 transitions. [2022-10-16 10:47:40,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 165 transitions. [2022-10-16 10:47:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-16 10:47:40,234 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:40,235 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:40,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-10-16 10:47:40,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-16 10:47:40,450 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:40,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1245709113, now seen corresponding path program 1 times [2022-10-16 10:47:40,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:40,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252224040] [2022-10-16 10:47:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:47:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:40,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252224040] [2022-10-16 10:47:40,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252224040] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:40,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056157035] [2022-10-16 10:47:40,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:40,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:40,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:40,567 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:47:40,578 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:47:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:40,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:47:40,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:47:40,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:47:40,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056157035] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:40,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:47:40,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:47:40,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173083854] [2022-10-16 10:47:40,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:40,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:47:40,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:47:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:47:40,672 INFO L87 Difference]: Start difference. First operand 132 states and 165 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:40,751 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2022-10-16 10:47:40,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:47:40,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-16 10:47:40,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:40,753 INFO L225 Difference]: With dead ends: 134 [2022-10-16 10:47:40,753 INFO L226 Difference]: Without dead ends: 133 [2022-10-16 10:47:40,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:47:40,754 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:40,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 142 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-10-16 10:47:40,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-10-16 10:47:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 121 states have (on average 1.322314049586777) internal successors, (160), 130 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2022-10-16 10:47:40,767 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 29 [2022-10-16 10:47:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:40,768 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2022-10-16 10:47:40,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-10-16 10:47:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-16 10:47:40,769 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:40,769 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:40,804 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:47:40,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 10:47:40,984 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:40,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:40,985 INFO L85 PathProgramCache]: Analyzing trace with hash 874414924, now seen corresponding path program 1 times [2022-10-16 10:47:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:40,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107388199] [2022-10-16 10:47:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:40,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:41,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:47:41,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719146453] [2022-10-16 10:47:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:41,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:41,003 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:47:41,024 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:47:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:41,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:47:41,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:47:41,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 10:47:41,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:41,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107388199] [2022-10-16 10:47:41,240 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:47:41,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719146453] [2022-10-16 10:47:41,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719146453] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:41,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:47:41,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-10-16 10:47:41,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468358152] [2022-10-16 10:47:41,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:41,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:47:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:47:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:47:41,243 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:41,425 INFO L93 Difference]: Finished difference Result 143 states and 164 transitions. [2022-10-16 10:47:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 10:47:41,426 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-16 10:47:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:41,427 INFO L225 Difference]: With dead ends: 143 [2022-10-16 10:47:41,427 INFO L226 Difference]: Without dead ends: 110 [2022-10-16 10:47:41,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-10-16 10:47:41,429 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 63 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:41,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 239 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-16 10:47:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2022-10-16 10:47:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 104 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2022-10-16 10:47:41,436 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 30 [2022-10-16 10:47:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:41,436 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2022-10-16 10:47:41,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-10-16 10:47:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-16 10:47:41,437 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:41,437 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:41,473 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:47:41,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 10:47:41,650 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:41,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1892149553, now seen corresponding path program 3 times [2022-10-16 10:47:41,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:41,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718142533] [2022-10-16 10:47:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:41,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:41,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:41,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718142533] [2022-10-16 10:47:41,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718142533] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:41,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466865671] [2022-10-16 10:47:41,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:47:41,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:41,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:41,860 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:47:41,861 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:47:41,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:47:41,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:41,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:47:41,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:42,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:42,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466865671] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:42,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:42,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2022-10-16 10:47:42,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188249755] [2022-10-16 10:47:42,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:42,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:47:42,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:42,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:47:42,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-10-16 10:47:42,229 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:42,529 INFO L93 Difference]: Finished difference Result 238 states and 280 transitions. [2022-10-16 10:47:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:47:42,529 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-16 10:47:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:42,531 INFO L225 Difference]: With dead ends: 238 [2022-10-16 10:47:42,531 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:47:42,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:47:42,533 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 204 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:42,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 259 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:47:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:47:42,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 142. [2022-10-16 10:47:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.303030303030303) internal successors, (172), 141 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 172 transitions. [2022-10-16 10:47:42,543 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 172 transitions. Word has length 32 [2022-10-16 10:47:42,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:42,543 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 172 transitions. [2022-10-16 10:47:42,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 172 transitions. [2022-10-16 10:47:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-16 10:47:42,544 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:42,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:42,583 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:47:42,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-16 10:47:42,751 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:42,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:42,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1277475512, now seen corresponding path program 2 times [2022-10-16 10:47:42,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:42,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28028027] [2022-10-16 10:47:42,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:42,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:42,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:47:42,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968097924] [2022-10-16 10:47:42,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:47:42,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:42,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:42,772 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:47:42,779 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:47:42,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:47:42,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:42,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-16 10:47:42,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:47:42,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 10:47:42,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:42,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28028027] [2022-10-16 10:47:42,982 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:47:42,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968097924] [2022-10-16 10:47:42,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968097924] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:42,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:47:42,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-10-16 10:47:42,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552657895] [2022-10-16 10:47:42,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:42,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:47:42,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:42,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:47:42,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:47:42,985 INFO L87 Difference]: Start difference. First operand 142 states and 172 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:43,192 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2022-10-16 10:47:43,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 10:47:43,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-10-16 10:47:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:43,194 INFO L225 Difference]: With dead ends: 187 [2022-10-16 10:47:43,194 INFO L226 Difference]: Without dead ends: 144 [2022-10-16 10:47:43,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-10-16 10:47:43,195 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:43,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 163 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-10-16 10:47:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2022-10-16 10:47:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 132 states have (on average 1.2878787878787878) internal successors, (170), 141 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2022-10-16 10:47:43,205 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 34 [2022-10-16 10:47:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:43,205 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2022-10-16 10:47:43,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2022-10-16 10:47:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 10:47:43,206 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:43,206 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:43,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-10-16 10:47:43,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:43,420 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:43,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash 315378123, now seen corresponding path program 4 times [2022-10-16 10:47:43,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:43,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154200172] [2022-10-16 10:47:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:44,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:44,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154200172] [2022-10-16 10:47:44,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154200172] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:44,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325081341] [2022-10-16 10:47:44,131 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:47:44,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:44,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:44,136 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:47:44,143 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:47:44,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:47:44,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:44,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-16 10:47:44,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:44,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:47:44,349 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:47:44,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:47:44,424 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:47:44,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:47:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:44,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:44,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-10-16 10:47:44,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:47:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:44,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325081341] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:44,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:44,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 32 [2022-10-16 10:47:44,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809075985] [2022-10-16 10:47:44,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:44,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:47:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:44,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:47:44,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:47:44,697 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:45,475 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-10-16 10:47:45,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:47:45,476 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-10-16 10:47:45,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:45,477 INFO L225 Difference]: With dead ends: 199 [2022-10-16 10:47:45,477 INFO L226 Difference]: Without dead ends: 146 [2022-10-16 10:47:45,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2022-10-16 10:47:45,479 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 76 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:45,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 740 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 10:47:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-10-16 10:47:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2022-10-16 10:47:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 132 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2022-10-16 10:47:45,488 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 36 [2022-10-16 10:47:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:45,489 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2022-10-16 10:47:45,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.625) internal successors, (84), 32 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2022-10-16 10:47:45,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:47:45,490 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:45,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:45,528 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:45,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-10-16 10:47:45,704 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:45,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:45,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1855075176, now seen corresponding path program 3 times [2022-10-16 10:47:45,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:45,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644513710] [2022-10-16 10:47:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:45,721 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:47:45,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302067411] [2022-10-16 10:47:45,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:47:45,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:45,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:45,723 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:45,750 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:45,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-16 10:47:45,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:45,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjunts are in the unsatisfiable core [2022-10-16 10:47:45,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:45,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:47:46,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:47:46,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 10:47:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 10:47:46,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:46,637 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_466 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (not (< |v_ULTIMATE.start_main_~i~0#1_76| c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 2))) is different from false [2022-10-16 10:47:46,655 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_466 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_76| 1)) (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 2))) is different from false [2022-10-16 10:47:46,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_466 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (< |c_ULTIMATE.start_main_#t~post7#1| |v_ULTIMATE.start_main_~i~0#1_76|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 2))) is different from false [2022-10-16 10:47:46,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_466 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_76|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 2))) is different from false [2022-10-16 10:47:46,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (v_ArrVal_466 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 1))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 2) (< |v_ULTIMATE.start_main_~i~0#1_76| 1) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_76|))) is different from false [2022-10-16 10:47:46,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:46,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2022-10-16 10:47:46,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:46,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2022-10-16 10:47:46,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-10-16 10:47:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 7 not checked. [2022-10-16 10:47:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644513710] [2022-10-16 10:47:47,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:47:47,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302067411] [2022-10-16 10:47:47,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302067411] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:47,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:47:47,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-10-16 10:47:47,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543394806] [2022-10-16 10:47:47,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:47,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:47:47,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:47:47,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=604, Unknown=6, NotChecked=270, Total=992 [2022-10-16 10:47:47,107 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:47,940 INFO L93 Difference]: Finished difference Result 188 states and 231 transitions. [2022-10-16 10:47:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:47:47,941 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:47:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:47,942 INFO L225 Difference]: With dead ends: 188 [2022-10-16 10:47:47,942 INFO L226 Difference]: Without dead ends: 161 [2022-10-16 10:47:47,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=222, Invalid=1186, Unknown=18, NotChecked=380, Total=1806 [2022-10-16 10:47:47,945 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:47,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 322 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 361 Unchecked, 0.1s Time] [2022-10-16 10:47:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-10-16 10:47:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-10-16 10:47:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 158 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 192 transitions. [2022-10-16 10:47:47,958 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 192 transitions. Word has length 41 [2022-10-16 10:47:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:47,959 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 192 transitions. [2022-10-16 10:47:47,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 192 transitions. [2022-10-16 10:47:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-16 10:47:47,959 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:47,960 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:47,996 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:48,173 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:48,174 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:48,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1855074984, now seen corresponding path program 1 times [2022-10-16 10:47:48,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:48,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859631946] [2022-10-16 10:47:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:48,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:47:48,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:48,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859631946] [2022-10-16 10:47:48,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859631946] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:48,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781369553] [2022-10-16 10:47:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:48,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:48,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:48,573 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:48,575 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:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:48,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2022-10-16 10:47:48,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:48,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:47:48,684 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:48,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:48,718 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:48,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, 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:48,778 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:48,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-10-16 10:47:49,013 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:49,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 30 [2022-10-16 10:47:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:47:49,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:51,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_507 (Array Int Int)) (v_ArrVal_508 Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_507))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_507 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_508)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_86| 4))))) (or (< 2 .cse0) (< (+ (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse0) v_ArrVal_508) (< (+ v_ArrVal_508 .cse2) 9223372036854775808) (< 2 .cse2)))))) is different from false [2022-10-16 10:47:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2022-10-16 10:47:52,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781369553] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:52,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:52,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2022-10-16 10:47:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875067147] [2022-10-16 10:47:52,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:52,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 10:47:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:52,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 10:47:52,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=324, Unknown=2, NotChecked=38, Total=462 [2022-10-16 10:47:52,200 INFO L87 Difference]: Start difference. First operand 159 states and 192 transitions. Second operand has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:52,482 INFO L93 Difference]: Finished difference Result 185 states and 224 transitions. [2022-10-16 10:47:52,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:47:52,482 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-10-16 10:47:52,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:52,484 INFO L225 Difference]: With dead ends: 185 [2022-10-16 10:47:52,484 INFO L226 Difference]: Without dead ends: 184 [2022-10-16 10:47:52,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=164, Invalid=488, Unknown=2, NotChecked=48, Total=702 [2022-10-16 10:47:52,485 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 50 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:52,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 265 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 140 Unchecked, 0.1s Time] [2022-10-16 10:47:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-10-16 10:47:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 175. [2022-10-16 10:47:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 165 states have (on average 1.290909090909091) internal successors, (213), 174 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 213 transitions. [2022-10-16 10:47:52,500 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 213 transitions. Word has length 41 [2022-10-16 10:47:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:52,500 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 213 transitions. [2022-10-16 10:47:52,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 213 transitions. [2022-10-16 10:47:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-10-16 10:47:52,501 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:52,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:52,544 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:52,714 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:52,714 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1672749764, now seen corresponding path program 1 times [2022-10-16 10:47:52,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:52,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711452666] [2022-10-16 10:47:52,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:52,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:47:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:52,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711452666] [2022-10-16 10:47:52,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711452666] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:52,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546315212] [2022-10-16 10:47:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:52,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:52,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:52,952 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:52,972 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:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:53,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-16 10:47:53,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:53,044 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:53,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:47:53,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 31 [2022-10-16 10:47:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:47:53,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:47:53,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546315212] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:53,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:47:53,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-10-16 10:47:53,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873996648] [2022-10-16 10:47:53,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:53,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 10:47:53,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:53,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 10:47:53,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-10-16 10:47:53,102 INFO L87 Difference]: Start difference. First operand 175 states and 213 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:53,190 INFO L93 Difference]: Finished difference Result 175 states and 213 transitions. [2022-10-16 10:47:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 10:47:53,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-10-16 10:47:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:53,192 INFO L225 Difference]: With dead ends: 175 [2022-10-16 10:47:53,192 INFO L226 Difference]: Without dead ends: 174 [2022-10-16 10:47:53,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:47:53,193 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:53,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 77 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-10-16 10:47:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-10-16 10:47:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 165 states have (on average 1.2606060606060605) internal successors, (208), 173 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2022-10-16 10:47:53,207 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 42 [2022-10-16 10:47:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:53,208 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2022-10-16 10:47:53,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2022-10-16 10:47:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-16 10:47:53,209 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:53,209 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:53,248 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:53,423 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:53,423 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:53,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1687435661, now seen corresponding path program 5 times [2022-10-16 10:47:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:53,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424778220] [2022-10-16 10:47:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:53,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:53,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424778220] [2022-10-16 10:47:53,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424778220] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:53,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319390356] [2022-10-16 10:47:53,706 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:47:53,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:53,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:53,708 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:53,731 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:53,854 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:47:53,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:53,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:47:53,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:54,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:54,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319390356] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:54,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:54,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2022-10-16 10:47:54,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691223907] [2022-10-16 10:47:54,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:54,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-16 10:47:54,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:54,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-16 10:47:54,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2022-10-16 10:47:54,307 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:54,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:54,852 INFO L93 Difference]: Finished difference Result 330 states and 395 transitions. [2022-10-16 10:47:54,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-10-16 10:47:54,853 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-10-16 10:47:54,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:54,854 INFO L225 Difference]: With dead ends: 330 [2022-10-16 10:47:54,855 INFO L226 Difference]: Without dead ends: 255 [2022-10-16 10:47:54,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 62 SyntacticMatches, 13 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:47:54,857 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 217 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:54,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 305 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:47:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-10-16 10:47:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 218. [2022-10-16 10:47:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 209 states have (on average 1.2344497607655502) internal successors, (258), 217 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 258 transitions. [2022-10-16 10:47:54,874 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 258 transitions. Word has length 43 [2022-10-16 10:47:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:54,874 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 258 transitions. [2022-10-16 10:47:54,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 28 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 258 transitions. [2022-10-16 10:47:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-16 10:47:54,875 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:54,875 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:54,917 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:55,091 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:55,091 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:55,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1194758214, now seen corresponding path program 1 times [2022-10-16 10:47:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:55,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945038599] [2022-10-16 10:47:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:47:55,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:55,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945038599] [2022-10-16 10:47:55,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945038599] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:55,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508242228] [2022-10-16 10:47:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:55,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:55,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:55,214 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:55,234 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:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:55,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:47:55,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:47:55,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:47:55,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508242228] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:55,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:55,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-10-16 10:47:55,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143196235] [2022-10-16 10:47:55,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:55,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 10:47:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:55,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 10:47:55,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-10-16 10:47:55,371 INFO L87 Difference]: Start difference. First operand 218 states and 258 transitions. Second operand has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:55,570 INFO L93 Difference]: Finished difference Result 292 states and 351 transitions. [2022-10-16 10:47:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:47:55,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-10-16 10:47:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:55,573 INFO L225 Difference]: With dead ends: 292 [2022-10-16 10:47:55,573 INFO L226 Difference]: Without dead ends: 291 [2022-10-16 10:47:55,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-16 10:47:55,575 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 57 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:55,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 235 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-10-16 10:47:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 266. [2022-10-16 10:47:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 257 states have (on average 1.2879377431906616) internal successors, (331), 265 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 331 transitions. [2022-10-16 10:47:55,601 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 331 transitions. Word has length 44 [2022-10-16 10:47:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:55,602 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 331 transitions. [2022-10-16 10:47:55,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.0) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 331 transitions. [2022-10-16 10:47:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-16 10:47:55,604 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:55,604 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:55,647 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:55,817 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:55,817 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:55,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1617200910, now seen corresponding path program 1 times [2022-10-16 10:47:55,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:55,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278641641] [2022-10-16 10:47:55,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:55,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:47:55,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:55,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278641641] [2022-10-16 10:47:55,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278641641] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:55,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837323624] [2022-10-16 10:47:55,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:55,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:55,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:55,933 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:55,953 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:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:56,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-16 10:47:56,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:47:56,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 10:47:56,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837323624] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 10:47:56,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 10:47:56,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-16 10:47:56,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120648915] [2022-10-16 10:47:56,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 10:47:56,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 10:47:56,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:56,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 10:47:56,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 10:47:56,050 INFO L87 Difference]: Start difference. First operand 266 states and 331 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:56,134 INFO L93 Difference]: Finished difference Result 268 states and 331 transitions. [2022-10-16 10:47:56,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 10:47:56,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-10-16 10:47:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:56,136 INFO L225 Difference]: With dead ends: 268 [2022-10-16 10:47:56,136 INFO L226 Difference]: Without dead ends: 267 [2022-10-16 10:47:56,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-16 10:47:56,138 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:56,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 80 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:47:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-10-16 10:47:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2022-10-16 10:47:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 257 states have (on average 1.2490272373540856) internal successors, (321), 264 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 321 transitions. [2022-10-16 10:47:56,160 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 321 transitions. Word has length 45 [2022-10-16 10:47:56,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:56,160 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 321 transitions. [2022-10-16 10:47:56,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 321 transitions. [2022-10-16 10:47:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-16 10:47:56,161 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:56,162 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:56,206 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:56,375 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:56,375 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:56,376 INFO L85 PathProgramCache]: Analyzing trace with hash 411246071, now seen corresponding path program 6 times [2022-10-16 10:47:56,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:56,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025200269] [2022-10-16 10:47:56,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:56,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:57,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:57,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025200269] [2022-10-16 10:47:57,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025200269] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:57,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015851664] [2022-10-16 10:47:57,488 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:47:57,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:57,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:57,489 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:57,500 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:57,594 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-10-16 10:47:57,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:47:57,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-16 10:47:57,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:47:57,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-16 10:47:57,788 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:47:57,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:47:57,869 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:47:57,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:47:57,970 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:47:57,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:47:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:58,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:47:58,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-10-16 10:47:58,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:47:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:47:58,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015851664] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:47:58,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:47:58,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 42 [2022-10-16 10:47:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748394871] [2022-10-16 10:47:58,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:47:58,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-16 10:47:58,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:47:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-16 10:47:58,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2022-10-16 10:47:58,433 INFO L87 Difference]: Start difference. First operand 265 states and 321 transitions. Second operand has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:47:59,597 INFO L93 Difference]: Finished difference Result 343 states and 418 transitions. [2022-10-16 10:47:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:47:59,599 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-10-16 10:47:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:47:59,602 INFO L225 Difference]: With dead ends: 343 [2022-10-16 10:47:59,602 INFO L226 Difference]: Without dead ends: 275 [2022-10-16 10:47:59,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=2511, Unknown=0, NotChecked=0, Total=2756 [2022-10-16 10:47:59,608 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 142 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 10:47:59,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 959 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 10:47:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-10-16 10:47:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2022-10-16 10:47:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 253 states have (on average 1.2411067193675889) internal successors, (314), 260 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 314 transitions. [2022-10-16 10:47:59,630 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 314 transitions. Word has length 47 [2022-10-16 10:47:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:47:59,630 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 314 transitions. [2022-10-16 10:47:59,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.6904761904761907) internal successors, (113), 42 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:47:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 314 transitions. [2022-10-16 10:47:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-16 10:47:59,632 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:47:59,632 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:47:59,673 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:47:59,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-10-16 10:47:59,847 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:47:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:47:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash 377560238, now seen corresponding path program 1 times [2022-10-16 10:47:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:47:59,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70790224] [2022-10-16 10:47:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:59,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:47:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:47:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-10-16 10:47:59,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:47:59,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70790224] [2022-10-16 10:47:59,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70790224] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:47:59,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7207482] [2022-10-16 10:47:59,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:47:59,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:47:59,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:47:59,943 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:47:59,966 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:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:00,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 10:48:00,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:48:00,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:48:00,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7207482] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:00,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:00,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 24 [2022-10-16 10:48:00,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609113987] [2022-10-16 10:48:00,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:00,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-16 10:48:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:00,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-16 10:48:00,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2022-10-16 10:48:00,355 INFO L87 Difference]: Start difference. First operand 261 states and 314 transitions. Second operand has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:00,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:00,944 INFO L93 Difference]: Finished difference Result 571 states and 679 transitions. [2022-10-16 10:48:00,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:48:00,945 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-10-16 10:48:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:00,948 INFO L225 Difference]: With dead ends: 571 [2022-10-16 10:48:00,949 INFO L226 Difference]: Without dead ends: 564 [2022-10-16 10:48:00,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=508, Invalid=1748, Unknown=0, NotChecked=0, Total=2256 [2022-10-16 10:48:00,951 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 606 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:00,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 354 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:48:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-10-16 10:48:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 339. [2022-10-16 10:48:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 331 states have (on average 1.2356495468277946) internal successors, (409), 338 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 409 transitions. [2022-10-16 10:48:00,981 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 409 transitions. Word has length 49 [2022-10-16 10:48:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:00,981 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 409 transitions. [2022-10-16 10:48:00,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.416666666666667) internal successors, (106), 25 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:00,982 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 409 transitions. [2022-10-16 10:48:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-16 10:48:00,983 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:00,983 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:01,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:01,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-16 10:48:01,198 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash 522181700, now seen corresponding path program 4 times [2022-10-16 10:48:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:01,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095640243] [2022-10-16 10:48:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:01,215 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:48:01,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554556663] [2022-10-16 10:48:01,216 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:48:01,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:01,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:01,218 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:01,234 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:01,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:48:01,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:01,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 10:48:01,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:01,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:48:01,603 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:01,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:01,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:01,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:48:01,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-16 10:48:01,780 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:48:01,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:01,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_798 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |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)) 2)) is different from false [2022-10-16 10:48:01,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_798 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:48:01,887 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 Int) (v_ArrVal_798 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_796)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2)) is different from false [2022-10-16 10:48:01,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (forall ((v_ArrVal_796 Int) (v_ArrVal_798 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_796)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)))) is different from false [2022-10-16 10:48:01,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 Int) (v_ArrVal_798 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_796)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:48:11,369 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:48:11,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:48:11,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:48:11,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:48:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 22 not checked. [2022-10-16 10:48:11,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:11,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095640243] [2022-10-16 10:48:11,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:48:11,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554556663] [2022-10-16 10:48:11,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554556663] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:11,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:48:11,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-10-16 10:48:11,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363565586] [2022-10-16 10:48:11,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:11,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 10:48:11,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 10:48:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=537, Unknown=23, NotChecked=260, Total=930 [2022-10-16 10:48:11,542 INFO L87 Difference]: Start difference. First operand 339 states and 409 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:12,406 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= 2 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_ArrVal_796 Int) (v_ArrVal_798 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_796)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-10-16 10:48:14,411 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (forall ((v_ArrVal_796 Int) (v_ArrVal_798 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_796)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 1 |c_ULTIMATE.start_main_#t~post7#1|) (= (select .cse0 .cse1) 2))) is different from false [2022-10-16 10:48:16,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_796 Int) (v_ArrVal_798 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_796)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_126| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (forall ((v_ArrVal_798 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (= (select .cse0 .cse1) 2))) is different from false [2022-10-16 10:48:18,298 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_126| Int)) (or (forall ((v_ArrVal_796 Int) (v_ArrVal_798 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_126| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_796)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_126|)))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_ArrVal_798 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_798) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (= (select .cse0 .cse1) 2))) is different from false [2022-10-16 10:48:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:20,180 INFO L93 Difference]: Finished difference Result 525 states and 651 transitions. [2022-10-16 10:48:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-16 10:48:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-10-16 10:48:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:20,184 INFO L225 Difference]: With dead ends: 525 [2022-10-16 10:48:20,184 INFO L226 Difference]: Without dead ends: 456 [2022-10-16 10:48:20,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=167, Invalid=830, Unknown=31, NotChecked=612, Total=1640 [2022-10-16 10:48:20,186 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 91 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:20,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 375 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 451 Invalid, 0 Unknown, 462 Unchecked, 0.3s Time] [2022-10-16 10:48:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-10-16 10:48:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 363. [2022-10-16 10:48:20,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 355 states have (on average 1.2253521126760563) internal successors, (435), 362 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 435 transitions. [2022-10-16 10:48:20,219 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 435 transitions. Word has length 52 [2022-10-16 10:48:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:20,219 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 435 transitions. [2022-10-16 10:48:20,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 31 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 435 transitions. [2022-10-16 10:48:20,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-16 10:48:20,220 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:20,220 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:20,250 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:20,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-10-16 10:48:20,433 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:20,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:20,434 INFO L85 PathProgramCache]: Analyzing trace with hash 819079367, now seen corresponding path program 7 times [2022-10-16 10:48:20,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:20,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845248066] [2022-10-16 10:48:20,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:20,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:20,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:20,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845248066] [2022-10-16 10:48:20,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845248066] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:20,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464996327] [2022-10-16 10:48:20,830 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:48:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:20,832 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:20,852 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:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:20,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-16 10:48:20,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:21,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 50 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:21,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464996327] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:21,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:21,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 34 [2022-10-16 10:48:21,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639370944] [2022-10-16 10:48:21,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:21,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:48:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:21,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:48:21,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2022-10-16 10:48:21,627 INFO L87 Difference]: Start difference. First operand 363 states and 435 transitions. Second operand has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:22,579 INFO L93 Difference]: Finished difference Result 544 states and 648 transitions. [2022-10-16 10:48:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-16 10:48:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-10-16 10:48:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:22,583 INFO L225 Difference]: With dead ends: 544 [2022-10-16 10:48:22,583 INFO L226 Difference]: Without dead ends: 458 [2022-10-16 10:48:22,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 78 SyntacticMatches, 17 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1401 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=599, Invalid=3183, Unknown=0, NotChecked=0, Total=3782 [2022-10-16 10:48:22,586 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 419 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:22,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 359 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:48:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-10-16 10:48:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 386. [2022-10-16 10:48:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 378 states have (on average 1.216931216931217) internal successors, (460), 385 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 460 transitions. [2022-10-16 10:48:22,621 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 460 transitions. Word has length 54 [2022-10-16 10:48:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:22,621 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 460 transitions. [2022-10-16 10:48:22,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 460 transitions. [2022-10-16 10:48:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 10:48:22,622 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:22,623 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:22,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-10-16 10:48:22,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:22,836 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash -878456120, now seen corresponding path program 5 times [2022-10-16 10:48:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:22,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182418607] [2022-10-16 10:48:22,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:22,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:22,855 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:48:22,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1550293551] [2022-10-16 10:48:22,856 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:48:22,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:22,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:22,857 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:22,874 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:22,968 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-10-16 10:48:22,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:22,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:48:22,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:48:23,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 10:48:23,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:23,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182418607] [2022-10-16 10:48:23,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:48:23,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550293551] [2022-10-16 10:48:23,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550293551] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:23,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:48:23,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-10-16 10:48:23,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464041810] [2022-10-16 10:48:23,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:23,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 10:48:23,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 10:48:23,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:48:23,311 INFO L87 Difference]: Start difference. First operand 386 states and 460 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:23,678 INFO L93 Difference]: Finished difference Result 431 states and 508 transitions. [2022-10-16 10:48:23,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:48:23,679 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-10-16 10:48:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:23,681 INFO L225 Difference]: With dead ends: 431 [2022-10-16 10:48:23,681 INFO L226 Difference]: Without dead ends: 372 [2022-10-16 10:48:23,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:48:23,682 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 119 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:23,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 293 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:48:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-10-16 10:48:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2022-10-16 10:48:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 362 states have (on average 1.223756906077348) internal successors, (443), 369 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call 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,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 443 transitions. [2022-10-16 10:48:23,715 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 443 transitions. Word has length 55 [2022-10-16 10:48:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:23,716 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 443 transitions. [2022-10-16 10:48:23,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:23,716 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 443 transitions. [2022-10-16 10:48:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 10:48:23,717 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:23,717 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:23,756 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:23,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:23,930 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:23,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash -970475837, now seen corresponding path program 8 times [2022-10-16 10:48:23,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:23,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024721693] [2022-10-16 10:48:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:24,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:24,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024721693] [2022-10-16 10:48:24,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024721693] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:24,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882789904] [2022-10-16 10:48:24,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:24,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:24,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:24,969 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:24,986 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:25,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:48:25,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:25,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 53 conjunts are in the unsatisfiable core [2022-10-16 10:48:25,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:25,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:48:25,186 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:25,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:25,256 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:25,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:25,358 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:25,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:25,457 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:25,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:25,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:25,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-10-16 10:48:25,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:48:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:25,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882789904] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:25,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:25,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 32 [2022-10-16 10:48:25,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262590172] [2022-10-16 10:48:25,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:25,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-16 10:48:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:25,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-16 10:48:25,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2022-10-16 10:48:25,763 INFO L87 Difference]: Start difference. First operand 370 states and 443 transitions. Second operand has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:27,004 INFO L93 Difference]: Finished difference Result 515 states and 634 transitions. [2022-10-16 10:48:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-16 10:48:27,007 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-10-16 10:48:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:27,011 INFO L225 Difference]: With dead ends: 515 [2022-10-16 10:48:27,011 INFO L226 Difference]: Without dead ends: 397 [2022-10-16 10:48:27,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2022-10-16 10:48:27,015 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 121 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:27,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 777 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 10:48:27,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-10-16 10:48:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 372. [2022-10-16 10:48:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 364 states have (on average 1.2225274725274726) internal successors, (445), 371 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call 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:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 445 transitions. [2022-10-16 10:48:27,052 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 445 transitions. Word has length 58 [2022-10-16 10:48:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:27,052 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 445 transitions. [2022-10-16 10:48:27,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.875) internal successors, (92), 32 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 445 transitions. [2022-10-16 10:48:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-16 10:48:27,053 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:27,053 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:27,088 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:27,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-10-16 10:48:27,269 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:27,270 INFO L85 PathProgramCache]: Analyzing trace with hash -520092596, now seen corresponding path program 6 times [2022-10-16 10:48:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:27,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801459243] [2022-10-16 10:48:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:27,287 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:48:27,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125219715] [2022-10-16 10:48:27,287 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:48:27,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:27,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:27,289 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:27,313 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:27,437 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-10-16 10:48:27,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:27,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:48:27,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:48:27,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 10:48:27,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:27,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801459243] [2022-10-16 10:48:27,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:48:27,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125219715] [2022-10-16 10:48:27,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125219715] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:27,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:48:27,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-10-16 10:48:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963011045] [2022-10-16 10:48:27,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:27,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-16 10:48:27,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:27,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-16 10:48:27,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:48:27,968 INFO L87 Difference]: Start difference. First operand 372 states and 445 transitions. Second operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 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:48:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:28,436 INFO L93 Difference]: Finished difference Result 445 states and 522 transitions. [2022-10-16 10:48:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-16 10:48:28,438 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 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) Word has length 59 [2022-10-16 10:48:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:28,440 INFO L225 Difference]: With dead ends: 445 [2022-10-16 10:48:28,440 INFO L226 Difference]: Without dead ends: 402 [2022-10-16 10:48:28,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=1037, Unknown=0, NotChecked=0, Total=1260 [2022-10-16 10:48:28,442 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 160 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:28,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 311 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 10:48:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-10-16 10:48:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2022-10-16 10:48:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 390 states have (on average 1.2076923076923076) internal successors, (471), 397 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 471 transitions. [2022-10-16 10:48:28,491 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 471 transitions. Word has length 59 [2022-10-16 10:48:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:28,492 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 471 transitions. [2022-10-16 10:48:28,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 24 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:48:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 471 transitions. [2022-10-16 10:48:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-10-16 10:48:28,493 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:28,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:28,532 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:28,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-10-16 10:48:28,706 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:28,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1085736359, now seen corresponding path program 7 times [2022-10-16 10:48:28,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:28,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641020754] [2022-10-16 10:48:28,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:28,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:28,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:48:28,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117900411] [2022-10-16 10:48:28,725 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-10-16 10:48:28,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:28,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:28,726 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:28,742 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:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:28,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-16 10:48:28,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:29,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:48:29,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:29,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:48:29,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:29,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:48:29,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-16 10:48:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 10:48:29,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:29,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:48:29,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-10-16 10:48:29,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:48:29,486 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-10-16 10:48:29,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 1))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-10-16 10:48:29,574 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:48:29,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-10-16 10:48:29,581 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:48:29,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:48:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 24 not checked. [2022-10-16 10:48:29,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:29,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641020754] [2022-10-16 10:48:29,794 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:48:29,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117900411] [2022-10-16 10:48:29,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117900411] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:29,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:48:29,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2022-10-16 10:48:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220931163] [2022-10-16 10:48:29,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:29,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-16 10:48:29,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:29,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-16 10:48:29,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=655, Unknown=5, NotChecked=280, Total=1056 [2022-10-16 10:48:29,797 INFO L87 Difference]: Start difference. First operand 398 states and 471 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:30,683 INFO L93 Difference]: Finished difference Result 539 states and 646 transitions. [2022-10-16 10:48:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 10:48:30,684 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-10-16 10:48:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:30,686 INFO L225 Difference]: With dead ends: 539 [2022-10-16 10:48:30,687 INFO L226 Difference]: Without dead ends: 446 [2022-10-16 10:48:30,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=187, Invalid=1018, Unknown=5, NotChecked=350, Total=1560 [2022-10-16 10:48:30,688 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 180 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 518 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:30,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 528 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 797 Invalid, 0 Unknown, 518 Unchecked, 0.5s Time] [2022-10-16 10:48:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-10-16 10:48:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 356. [2022-10-16 10:48:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 348 states have (on average 1.2270114942528736) internal successors, (427), 355 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 427 transitions. [2022-10-16 10:48:30,725 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 427 transitions. Word has length 59 [2022-10-16 10:48:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:30,726 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 427 transitions. [2022-10-16 10:48:30,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 427 transitions. [2022-10-16 10:48:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 10:48:30,727 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:30,727 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:30,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:30,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:30,942 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:30,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2026433844, now seen corresponding path program 2 times [2022-10-16 10:48:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:30,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844793765] [2022-10-16 10:48:30,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:48:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:31,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844793765] [2022-10-16 10:48:31,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844793765] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:31,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564059555] [2022-10-16 10:48:31,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:31,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:31,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:31,121 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:31,134 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:31,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-16 10:48:31,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:31,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 10:48:31,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-16 10:48:31,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-16 10:48:31,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564059555] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:31,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:31,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-10-16 10:48:31,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782546867] [2022-10-16 10:48:31,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:31,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 10:48:31,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 10:48:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-10-16 10:48:31,402 INFO L87 Difference]: Start difference. First operand 356 states and 427 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:31,675 INFO L93 Difference]: Finished difference Result 374 states and 447 transitions. [2022-10-16 10:48:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 10:48:31,675 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-10-16 10:48:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:31,677 INFO L225 Difference]: With dead ends: 374 [2022-10-16 10:48:31,677 INFO L226 Difference]: Without dead ends: 373 [2022-10-16 10:48:31,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2022-10-16 10:48:31,678 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 134 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:31,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 123 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 10:48:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-10-16 10:48:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 355. [2022-10-16 10:48:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 348 states have (on average 1.2155172413793103) internal successors, (423), 354 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 423 transitions. [2022-10-16 10:48:31,711 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 423 transitions. Word has length 61 [2022-10-16 10:48:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:31,711 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 423 transitions. [2022-10-16 10:48:31,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:31,712 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 423 transitions. [2022-10-16 10:48:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-16 10:48:31,712 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:31,713 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:31,736 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:31,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:31,914 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:31,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:31,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1574972464, now seen corresponding path program 8 times [2022-10-16 10:48:31,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:31,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239869070] [2022-10-16 10:48:31,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:31,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:31,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:48:31,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417078393] [2022-10-16 10:48:31,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:48:31,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:31,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:31,937 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:31,944 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:32,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:48:32,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:32,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 10:48:32,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-16 10:48:32,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-16 10:48:32,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:32,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239869070] [2022-10-16 10:48:32,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:48:32,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417078393] [2022-10-16 10:48:32,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417078393] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:32,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:48:32,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-10-16 10:48:32,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487183735] [2022-10-16 10:48:32,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:32,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 10:48:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:32,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 10:48:32,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-10-16 10:48:32,351 INFO L87 Difference]: Start difference. First operand 355 states and 423 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 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:48:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:32,740 INFO L93 Difference]: Finished difference Result 442 states and 524 transitions. [2022-10-16 10:48:32,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-16 10:48:32,744 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 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 63 [2022-10-16 10:48:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:32,746 INFO L225 Difference]: With dead ends: 442 [2022-10-16 10:48:32,746 INFO L226 Difference]: Without dead ends: 357 [2022-10-16 10:48:32,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 102 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2022-10-16 10:48:32,748 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 156 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:32,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 204 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:48:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-10-16 10:48:32,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2022-10-16 10:48:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 348 states have (on average 1.206896551724138) internal successors, (420), 354 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 420 transitions. [2022-10-16 10:48:32,773 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 420 transitions. Word has length 63 [2022-10-16 10:48:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:32,774 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 420 transitions. [2022-10-16 10:48:32,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 18 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:48:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 420 transitions. [2022-10-16 10:48:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 10:48:32,775 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:32,775 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:32,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:32,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:32,988 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:32,989 INFO L85 PathProgramCache]: Analyzing trace with hash 482497147, now seen corresponding path program 9 times [2022-10-16 10:48:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:32,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829249457] [2022-10-16 10:48:32,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:32,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 51 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:33,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:33,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829249457] [2022-10-16 10:48:33,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829249457] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:33,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500082109] [2022-10-16 10:48:33,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:48:33,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:33,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:33,570 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:48:33,571 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:48:33,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-10-16 10:48:33,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:33,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-16 10:48:33,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 80 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:34,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 80 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:34,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500082109] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:34,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:34,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 40 [2022-10-16 10:48:34,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462719655] [2022-10-16 10:48:34,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:34,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:48:34,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:34,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:48:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2022-10-16 10:48:34,810 INFO L87 Difference]: Start difference. First operand 355 states and 420 transitions. Second operand has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:35,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:35,936 INFO L93 Difference]: Finished difference Result 559 states and 660 transitions. [2022-10-16 10:48:35,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-10-16 10:48:35,937 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-10-16 10:48:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:35,940 INFO L225 Difference]: With dead ends: 559 [2022-10-16 10:48:35,940 INFO L226 Difference]: Without dead ends: 474 [2022-10-16 10:48:35,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 94 SyntacticMatches, 21 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=719, Invalid=3973, Unknown=0, NotChecked=0, Total=4692 [2022-10-16 10:48:35,942 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 255 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:35,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 364 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 10:48:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-10-16 10:48:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 392. [2022-10-16 10:48:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 385 states have (on average 1.1922077922077923) internal successors, (459), 391 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call 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:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 459 transitions. [2022-10-16 10:48:35,976 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 459 transitions. Word has length 65 [2022-10-16 10:48:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:35,976 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 459 transitions. [2022-10-16 10:48:35,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.875) internal successors, (115), 40 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 459 transitions. [2022-10-16 10:48:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-16 10:48:35,977 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:35,978 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:36,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:36,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-10-16 10:48:36,192 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1153339649, now seen corresponding path program 10 times [2022-10-16 10:48:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:36,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899280662] [2022-10-16 10:48:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:48:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:37,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:37,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899280662] [2022-10-16 10:48:37,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899280662] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:48:37,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085117911] [2022-10-16 10:48:37,649 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:48:37,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:37,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:37,651 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:48:37,652 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:48:37,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:48:37,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:37,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 63 conjunts are in the unsatisfiable core [2022-10-16 10:48:37,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:37,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:48:37,931 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:37,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:38,011 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:38,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:38,123 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:38,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:38,242 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:38,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:38,366 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:38,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:38,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:38,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-10-16 10:48:38,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-10-16 10:48:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:48:38,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085117911] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:38,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:48:38,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 38 [2022-10-16 10:48:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749662399] [2022-10-16 10:48:38,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:38,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-10-16 10:48:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:38,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-10-16 10:48:38,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-10-16 10:48:38,779 INFO L87 Difference]: Start difference. First operand 392 states and 459 transitions. Second operand has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:40,607 INFO L93 Difference]: Finished difference Result 555 states and 668 transitions. [2022-10-16 10:48:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:48:40,607 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-10-16 10:48:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:40,609 INFO L225 Difference]: With dead ends: 555 [2022-10-16 10:48:40,609 INFO L226 Difference]: Without dead ends: 438 [2022-10-16 10:48:40,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2022-10-16 10:48:40,611 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 131 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:40,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1016 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-10-16 10:48:40,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-10-16 10:48:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 406. [2022-10-16 10:48:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 399 states have (on average 1.1904761904761905) internal successors, (475), 405 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call 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:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 475 transitions. [2022-10-16 10:48:40,650 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 475 transitions. Word has length 69 [2022-10-16 10:48:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:40,651 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 475 transitions. [2022-10-16 10:48:40,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8947368421052633) internal successors, (110), 38 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 475 transitions. [2022-10-16 10:48:40,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 10:48:40,661 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:40,661 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:40,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:40,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-10-16 10:48:40,862 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:40,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1763655328, now seen corresponding path program 9 times [2022-10-16 10:48:40,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:40,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831885382] [2022-10-16 10:48:40,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:40,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:48:40,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661232777] [2022-10-16 10:48:40,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-16 10:48:40,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:40,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:40,882 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:48:40,891 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:48:41,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-10-16 10:48:41,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:41,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 10:48:41,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:48:41,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:48:41,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:48:41,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831885382] [2022-10-16 10:48:41,532 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:48:41,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661232777] [2022-10-16 10:48:41,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661232777] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:48:41,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:48:41,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-10-16 10:48:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380623534] [2022-10-16 10:48:41,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:48:41,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-16 10:48:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:48:41,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-16 10:48:41,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-10-16 10:48:41,535 INFO L87 Difference]: Start difference. First operand 406 states and 475 transitions. Second operand has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:48:41,972 INFO L93 Difference]: Finished difference Result 463 states and 545 transitions. [2022-10-16 10:48:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 10:48:41,973 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-10-16 10:48:41,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:48:41,975 INFO L225 Difference]: With dead ends: 463 [2022-10-16 10:48:41,975 INFO L226 Difference]: Without dead ends: 374 [2022-10-16 10:48:41,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=976, Unknown=0, NotChecked=0, Total=1190 [2022-10-16 10:48:41,977 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 106 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 10:48:41,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 292 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 10:48:41,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-10-16 10:48:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2022-10-16 10:48:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 365 states have (on average 1.1945205479452055) internal successors, (436), 371 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:48:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 436 transitions. [2022-10-16 10:48:42,010 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 436 transitions. Word has length 70 [2022-10-16 10:48:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:48:42,010 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 436 transitions. [2022-10-16 10:48:42,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call 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:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 436 transitions. [2022-10-16 10:48:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-10-16 10:48:42,011 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:48:42,011 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:48:42,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-10-16 10:48:42,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-10-16 10:48:42,218 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:48:42,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:48:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1198011565, now seen corresponding path program 10 times [2022-10-16 10:48:42,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:48:42,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104860568] [2022-10-16 10:48:42,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:48:42,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:48:42,242 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:48:42,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431247413] [2022-10-16 10:48:42,243 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-16 10:48:42,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:48:42,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:48:42,244 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:48:42,266 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:48:42,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-16 10:48:42,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:48:42,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 41 conjunts are in the unsatisfiable core [2022-10-16 10:48:42,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:48:42,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:48:42,807 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:48:42,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:48:42,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:42,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:48:43,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 10:48:43,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:48:43,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-16 10:48:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:48:43,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:48:43,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:48:43,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:48:43,295 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-10-16 10:48:43,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-10-16 10:48:43,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (v_ArrVal_1384 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1381)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:48:43,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_247| Int)) (or (forall ((v_ArrVal_1381 Int) (v_ArrVal_1384 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_247| 4)) v_ArrVal_1381)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_247|)))) is different from false [2022-10-16 10:48:43,392 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 Int) (|v_ULTIMATE.start_main_~i~0#1_247| Int) (v_ArrVal_1384 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_247| 4)) v_ArrVal_1381)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_247| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:48:59,786 INFO L356 Elim1Store]: treesize reduction 29, result has 48.2 percent of original size [2022-10-16 10:48:59,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2022-10-16 10:48:59,796 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:48:59,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:49:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 42 not checked. [2022-10-16 10:49:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:00,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104860568] [2022-10-16 10:49:00,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:00,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431247413] [2022-10-16 10:49:00,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431247413] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:00,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:00,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2022-10-16 10:49:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111806801] [2022-10-16 10:49:00,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:00,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-10-16 10:49:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-10-16 10:49:00,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=858, Unknown=20, NotChecked=462, Total=1482 [2022-10-16 10:49:00,051 INFO L87 Difference]: Start difference. First operand 372 states and 436 transitions. Second operand has 39 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 39 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:02,300 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (forall ((v_ArrVal_1381 Int) (|v_ULTIMATE.start_main_~i~0#1_247| Int) (v_ArrVal_1384 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_247| 4)) v_ArrVal_1381)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_247| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= 2 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= 2 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-10-16 10:49:04,306 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 .cse1) 2) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_247| Int)) (or (forall ((v_ArrVal_1381 Int) (v_ArrVal_1384 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_247| 4)) v_ArrVal_1381)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_247|)))) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|))) is different from false [2022-10-16 10:49:06,387 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 .cse1) 2) (forall ((v_ArrVal_1381 Int) (|v_ULTIMATE.start_main_~i~0#1_247| Int) (v_ArrVal_1384 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_247| 4)) v_ArrVal_1381)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_247| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_ArrVal_1384 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 2)))) is different from false [2022-10-16 10:49:08,393 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select .cse0 .cse1) 2) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((|v_ULTIMATE.start_main_~i~0#1_247| Int)) (or (forall ((v_ArrVal_1381 Int) (v_ArrVal_1384 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_247| 4)) v_ArrVal_1381)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_247|)))) (forall ((v_ArrVal_1384 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1384) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 2)))) is different from false [2022-10-16 10:49:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:11,091 INFO L93 Difference]: Finished difference Result 532 states and 636 transitions. [2022-10-16 10:49:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-16 10:49:11,092 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 39 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-10-16 10:49:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:11,094 INFO L225 Difference]: With dead ends: 532 [2022-10-16 10:49:11,094 INFO L226 Difference]: Without dead ends: 481 [2022-10-16 10:49:11,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 101 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=218, Invalid=1358, Unknown=28, NotChecked=946, Total=2550 [2022-10-16 10:49:11,096 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 149 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 658 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:11,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 496 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 770 Invalid, 0 Unknown, 658 Unchecked, 0.5s Time] [2022-10-16 10:49:11,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-10-16 10:49:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 406. [2022-10-16 10:49:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 399 states have (on average 1.1854636591478698) internal successors, (473), 405 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 473 transitions. [2022-10-16 10:49:11,147 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 473 transitions. Word has length 70 [2022-10-16 10:49:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:11,148 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 473 transitions. [2022-10-16 10:49:11,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 39 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 473 transitions. [2022-10-16 10:49:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-16 10:49:11,149 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:11,149 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:11,188 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:49:11,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-10-16 10:49:11,363 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:11,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:11,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1968023236, now seen corresponding path program 11 times [2022-10-16 10:49:11,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:11,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958459392] [2022-10-16 10:49:11,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:11,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:11,381 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:49:11,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886253382] [2022-10-16 10:49:11,382 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:49:11,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:11,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:11,383 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:49:11,405 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:49:11,651 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-10-16 10:49:11,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:11,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2022-10-16 10:49:11,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:11,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:49:11,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2022-10-16 10:49:11,903 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:11,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:49:11,999 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:12,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:49:12,106 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-10-16 10:49:12,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-10-16 10:49:12,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:12,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-16 10:49:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 58 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-10-16 10:49:12,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:12,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:49:12,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:49:12,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:49:12,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int)) (or (forall ((v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_259|)))) is different from false [2022-10-16 10:49:12,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:49:12,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:49:12,541 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_260|)))) is different from false [2022-10-16 10:49:12,583 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2022-10-16 10:49:12,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2022-10-16 10:49:12,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_261| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_261|)))) is different from false [2022-10-16 10:49:12,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_261| Int) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)) (< |v_ULTIMATE.start_main_~i~0#1_261| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:49:12,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_261| Int) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_261| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-10-16 10:49:13,012 INFO L356 Elim1Store]: treesize reduction 203, result has 20.1 percent of original size [2022-10-16 10:49:13,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 67 [2022-10-16 10:49:13,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:13,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:49:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 75 not checked. [2022-10-16 10:49:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:13,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958459392] [2022-10-16 10:49:13,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:13,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886253382] [2022-10-16 10:49:13,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886253382] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:13,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:13,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 37 [2022-10-16 10:49:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271048675] [2022-10-16 10:49:13,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:13,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-10-16 10:49:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:13,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-10-16 10:49:13,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=521, Unknown=12, NotChecked=684, Total=1332 [2022-10-16 10:49:13,095 INFO L87 Difference]: Start difference. First operand 406 states and 473 transitions. Second operand has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:14,470 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= 2 (select .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_261| Int) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 2) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)) (< |v_ULTIMATE.start_main_~i~0#1_261| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-10-16 10:49:16,476 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 1 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_261| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 2) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_261|)))) (= (select .cse0 .cse1) 2))) is different from false [2022-10-16 10:49:18,538 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_261| Int) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1| 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_261| .cse3))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 .cse2) 2))) is different from false [2022-10-16 10:49:20,551 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_261| Int) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 2) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)) (< |v_ULTIMATE.start_main_~i~0#1_261| .cse2))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 .cse1) 2) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| .cse2) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-10-16 10:49:22,557 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_#t~post7#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_260|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_261| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 2) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_261|)))) (= (select .cse0 .cse1) 2))) is different from false [2022-10-16 10:49:24,626 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_261| Int) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse0 .cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1| 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (< |v_ULTIMATE.start_main_~i~0#1_261| .cse3))) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 2) (< |v_ULTIMATE.start_main_~i~0#1_259| .cse3))) (= (select .cse0 .cse2) 2))) is different from false [2022-10-16 10:49:26,634 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_261| Int) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 2) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)) (< |v_ULTIMATE.start_main_~i~0#1_261| .cse2))) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (< |v_ULTIMATE.start_main_~i~0#1_259| .cse2))) (= (select .cse0 .cse1) 2) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| .cse2) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-10-16 10:49:28,640 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 3 |c_ULTIMATE.start_main_#t~post7#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_260|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_261| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_261| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 2) (< |v_ULTIMATE.start_main_~i~0#1_260| (+ |v_ULTIMATE.start_main_~i~0#1_261| 1)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_261|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int)) (or (forall ((v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_259|)))) (= (select .cse0 .cse1) 2))) is different from false [2022-10-16 10:49:29,535 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1447 Int) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| .cse3) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse0 .cse1 v_ArrVal_1447) (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 2) (< |v_ULTIMATE.start_main_~i~0#1_259| .cse3))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 .cse2) 2))) is different from false [2022-10-16 10:49:31,589 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (< |v_ULTIMATE.start_main_~i~0#1_259| .cse2))) (= (select .cse1 .cse0) 2) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (|v_ULTIMATE.start_main_~i~0#1_260| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_260| .cse2) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-10-16 10:49:33,606 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (<= 3 |c_ULTIMATE.start_main_#t~post7#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_260| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |v_ULTIMATE.start_main_~i~0#1_260| 1)) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_260| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_260|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int)) (or (forall ((v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (not (<= .cse2 |v_ULTIMATE.start_main_~i~0#1_259|)))) (= (select .cse1 .cse0) 2))) is different from false [2022-10-16 10:49:34,345 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 2) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 .cse2) 2))) is different from false [2022-10-16 10:49:35,093 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse1 v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1449 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse0 .cse1 v_ArrVal_1449) (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 2) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (<= 4 |c_ULTIMATE.start_main_~i~0#1|) (= (select .cse0 .cse2) 2))) is different from false [2022-10-16 10:49:35,820 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int) (v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (or (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (< |v_ULTIMATE.start_main_~i~0#1_259| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select .cse1 .cse0) 2))) is different from false [2022-10-16 10:49:37,834 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_259| Int)) (or (forall ((v_ArrVal_1451 Int) (v_ArrVal_1452 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 (+ (* |v_ULTIMATE.start_main_~i~0#1_259| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1451)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (not (<= (+ |c_ULTIMATE.start_main_#t~post7#1| 1) |v_ULTIMATE.start_main_~i~0#1_259|)))) (= (select .cse1 .cse0) 2))) is different from false [2022-10-16 10:49:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:38,116 INFO L93 Difference]: Finished difference Result 565 states and 670 transitions. [2022-10-16 10:49:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-10-16 10:49:38,117 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-10-16 10:49:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:38,119 INFO L225 Difference]: With dead ends: 565 [2022-10-16 10:49:38,119 INFO L226 Difference]: Without dead ends: 496 [2022-10-16 10:49:38,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 112 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=183, Invalid=768, Unknown=27, NotChecked=2214, Total=3192 [2022-10-16 10:49:38,121 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 827 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:38,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 573 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 571 Invalid, 0 Unknown, 827 Unchecked, 0.4s Time] [2022-10-16 10:49:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-10-16 10:49:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 425. [2022-10-16 10:49:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 418 states have (on average 1.186602870813397) internal successors, (496), 424 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 496 transitions. [2022-10-16 10:49:38,164 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 496 transitions. Word has length 74 [2022-10-16 10:49:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:38,164 INFO L495 AbstractCegarLoop]: Abstraction has 425 states and 496 transitions. [2022-10-16 10:49:38,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 37 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 496 transitions. [2022-10-16 10:49:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 10:49:38,166 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:38,166 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:38,200 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:49:38,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:38,380 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:38,381 INFO L85 PathProgramCache]: Analyzing trace with hash 445652671, now seen corresponding path program 11 times [2022-10-16 10:49:38,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:38,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486618189] [2022-10-16 10:49:38,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:38,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 81 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:39,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486618189] [2022-10-16 10:49:39,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486618189] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:39,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033347988] [2022-10-16 10:49:39,164 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-16 10:49:39,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:39,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:39,166 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:39,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-10-16 10:49:39,363 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-10-16 10:49:39,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:39,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2022-10-16 10:49:39,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 117 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:40,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 117 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:49:40,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033347988] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:40,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:49:40,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 46 [2022-10-16 10:49:40,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825012150] [2022-10-16 10:49:40,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:40,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-10-16 10:49:40,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-10-16 10:49:40,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1784, Unknown=0, NotChecked=0, Total=2070 [2022-10-16 10:49:40,883 INFO L87 Difference]: Start difference. First operand 425 states and 496 transitions. Second operand has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:43,119 INFO L93 Difference]: Finished difference Result 643 states and 747 transitions. [2022-10-16 10:49:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-10-16 10:49:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-10-16 10:49:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:43,123 INFO L225 Difference]: With dead ends: 643 [2022-10-16 10:49:43,123 INFO L226 Difference]: Without dead ends: 541 [2022-10-16 10:49:43,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 110 SyntacticMatches, 25 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3154 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1265, Invalid=7107, Unknown=0, NotChecked=0, Total=8372 [2022-10-16 10:49:43,128 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 341 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:43,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 488 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 10:49:43,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-10-16 10:49:43,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 469. [2022-10-16 10:49:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 462 states have (on average 1.173160173160173) internal successors, (542), 468 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 542 transitions. [2022-10-16 10:49:43,175 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 542 transitions. Word has length 76 [2022-10-16 10:49:43,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:43,176 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 542 transitions. [2022-10-16 10:49:43,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.891304347826087) internal successors, (133), 46 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 542 transitions. [2022-10-16 10:49:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 10:49:43,177 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:43,177 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:43,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-10-16 10:49:43,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-10-16 10:49:43,390 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash 952699344, now seen corresponding path program 12 times [2022-10-16 10:49:43,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:43,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140037163] [2022-10-16 10:49:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:43,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:43,413 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-10-16 10:49:43,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [876476245] [2022-10-16 10:49:43,414 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:49:43,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:43,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:43,415 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:43,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-10-16 10:49:43,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-10-16 10:49:43,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:43,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 52 conjunts are in the unsatisfiable core [2022-10-16 10:49:43,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:43,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:49:43,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-10-16 10:49:44,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:44,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:44,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-16 10:49:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 10:49:44,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:49:44,405 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) is different from false [2022-10-16 10:49:44,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-10-16 10:49:44,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:49:44,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_#t~post11#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-10-16 10:49:44,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-10-16 10:49:44,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-10-16 10:49:44,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1| 1))) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-10-16 10:49:44,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:44,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2022-10-16 10:49:44,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:44,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2022-10-16 10:49:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 46 not checked. [2022-10-16 10:49:44,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:44,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140037163] [2022-10-16 10:49:44,711 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-10-16 10:49:44,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876476245] [2022-10-16 10:49:44,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876476245] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:49:44,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-16 10:49:44,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2022-10-16 10:49:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817218136] [2022-10-16 10:49:44,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-16 10:49:44,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-16 10:49:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:49:44,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-16 10:49:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=620, Unknown=7, NotChecked=392, Total=1122 [2022-10-16 10:49:44,714 INFO L87 Difference]: Start difference. First operand 469 states and 542 transitions. Second operand has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:49:45,777 INFO L93 Difference]: Finished difference Result 601 states and 691 transitions. [2022-10-16 10:49:45,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-16 10:49:45,778 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-10-16 10:49:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:49:45,781 INFO L225 Difference]: With dead ends: 601 [2022-10-16 10:49:45,781 INFO L226 Difference]: Without dead ends: 568 [2022-10-16 10:49:45,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 120 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=162, Invalid=1049, Unknown=7, NotChecked=504, Total=1722 [2022-10-16 10:49:45,782 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 202 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 812 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 10:49:45,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 539 Invalid, 1854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1005 Invalid, 0 Unknown, 812 Unchecked, 0.6s Time] [2022-10-16 10:49:45,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-10-16 10:49:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 524. [2022-10-16 10:49:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 517 states have (on average 1.1586073500967118) internal successors, (599), 523 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 599 transitions. [2022-10-16 10:49:45,830 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 599 transitions. Word has length 77 [2022-10-16 10:49:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:49:45,830 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 599 transitions. [2022-10-16 10:49:45,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:49:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 599 transitions. [2022-10-16 10:49:45,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-10-16 10:49:45,831 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:49:45,832 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:49:45,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-10-16 10:49:46,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:46,045 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:49:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:49:46,046 INFO L85 PathProgramCache]: Analyzing trace with hash 952699152, now seen corresponding path program 2 times [2022-10-16 10:49:46,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:49:46,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126924225] [2022-10-16 10:49:46,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:49:46,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:49:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:49:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-16 10:49:46,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:49:46,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126924225] [2022-10-16 10:49:46,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126924225] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:49:46,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810242944] [2022-10-16 10:49:46,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 10:49:46,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:49:46,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:49:46,865 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:49:46,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-10-16 10:49:47,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 10:49:47,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:49:47,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 41 conjunts are in the unsatisfiable core [2022-10-16 10:49:47,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:49:47,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 10:49:47,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-16 10:49:47,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:47,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:47,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:47,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:47,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:47,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:47,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:47,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-16 10:49:47,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 30 [2022-10-16 10:49:47,682 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-16 10:49:47,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2022-10-16 10:49:48,000 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-10-16 10:49:48,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 61 [2022-10-16 10:49:48,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 10:49:48,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 98 [2022-10-16 10:49:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-10-16 10:49:48,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 10:50:07,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_302| Int) (v_ArrVal_1650 Int) (v_ArrVal_1652 Int) (v_ArrVal_1654 Int) (|v_ULTIMATE.start_main_~i~0#1_304| Int) (|v_ULTIMATE.start_main_~i~0#1_306| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1648))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1652)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_304| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select v_ArrVal_1648 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1654)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_302| 4)))) (.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_1650)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_306| 4))))) (or (< (+ .cse0 v_ArrVal_1652) v_ArrVal_1654) (< (+ .cse1 v_ArrVal_1650) v_ArrVal_1652) (< 2 .cse2) (< 2 .cse3) (< 2 .cse0) (< (+ .cse3 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) v_ArrVal_1650) (< (+ .cse2 v_ArrVal_1654) 9223372036854775808) (< 2 .cse1)))))) is different from false [2022-10-16 10:50:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 13 not checked. [2022-10-16 10:50:12,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810242944] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 10:50:12,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 10:50:12,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2022-10-16 10:50:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919647658] [2022-10-16 10:50:12,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 10:50:12,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-10-16 10:50:12,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 10:50:12,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-10-16 10:50:12,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1177, Unknown=9, NotChecked=74, Total=1560 [2022-10-16 10:50:12,461 INFO L87 Difference]: Start difference. First operand 524 states and 599 transitions. Second operand has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 10:50:18,670 INFO L93 Difference]: Finished difference Result 594 states and 692 transitions. [2022-10-16 10:50:18,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-16 10:50:18,671 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-10-16 10:50:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 10:50:18,673 INFO L225 Difference]: With dead ends: 594 [2022-10-16 10:50:18,673 INFO L226 Difference]: Without dead ends: 593 [2022-10-16 10:50:18,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=616, Invalid=2348, Unknown=10, NotChecked=106, Total=3080 [2022-10-16 10:50:18,674 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 83 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 10:50:18,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 450 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 252 Unchecked, 0.1s Time] [2022-10-16 10:50:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-10-16 10:50:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 580. [2022-10-16 10:50:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 573 states have (on average 1.1710296684118673) internal successors, (671), 579 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call 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:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 671 transitions. [2022-10-16 10:50:18,723 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 671 transitions. Word has length 77 [2022-10-16 10:50:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 10:50:18,723 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 671 transitions. [2022-10-16 10:50:18,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.3846153846153846) internal successors, (132), 40 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 10:50:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 671 transitions. [2022-10-16 10:50:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-16 10:50:18,725 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 10:50:18,725 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 10:50:18,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-10-16 10:50:18,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:18,926 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 10:50:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 10:50:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash 744540091, now seen corresponding path program 12 times [2022-10-16 10:50:18,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 10:50:18,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023107661] [2022-10-16 10:50:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 10:50:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 10:50:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 10:50:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:50:20,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 10:50:20,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023107661] [2022-10-16 10:50:20,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023107661] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 10:50:20,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114803122] [2022-10-16 10:50:20,912 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-10-16 10:50:20,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 10:50:20,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 10:50:20,913 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 10:50:20,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-10-16 10:50:21,337 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-10-16 10:50:21,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 10:50:21,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 51 conjunts are in the unsatisfiable core [2022-10-16 10:50:21,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 10:50:21,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-16 10:50:22,444 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-16 10:50:22,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-10-16 10:50:23,166 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-16 10:50:23,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 57 [2022-10-16 10:50:23,983 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-16 10:50:23,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 57 [2022-10-16 10:50:24,865 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-16 10:50:24,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 57 [2022-10-16 10:50:25,748 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-16 10:50:25,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 57 [2022-10-16 10:50:26,676 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-10-16 10:50:26,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 57 [2022-10-16 10:50:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 85 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 10:50:27,753 INFO L328 TraceCheckSpWp]: Computing backward predicates...