/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/heap-data/shared_mem2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:04:41,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:04:41,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:04:41,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:04:41,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:04:41,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:04:41,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:04:41,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:04:41,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:04:41,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:04:41,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:04:41,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:04:41,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:04:41,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:04:41,788 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:04:41,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:04:41,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:04:41,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:04:41,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:04:41,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:04:41,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:04:41,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:04:41,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:04:41,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:04:41,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:04:41,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:04:41,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:04:41,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:04:41,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:04:41,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:04:41,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:04:41,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:04:41,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:04:41,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:04:41,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:04:41,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:04:41,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:04:41,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:04:41,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:04:41,842 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:04:41,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:04:41,844 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 12:04:41,873 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:04:41,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:04:41,874 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:04:41,874 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:04:41,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:04:41,875 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:04:41,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:04:41,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:04:41,876 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:04:41,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:04:41,876 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:04:41,877 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:04:41,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:04:41,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:04:41,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:04:41,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:04:41,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:04:41,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:04:41,878 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:04:41,878 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:04:41,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:04:41,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:04:41,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:04:41,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:04:41,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:04:41,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:04:41,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:04:41,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:04:41,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:04:41,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:04:41,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:04:41,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:04:41,882 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:04:41,882 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 12:04:42,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:04:42,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:04:42,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:04:42,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:04:42,265 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:04:42,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem2.i [2022-10-16 12:04:42,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763356dde/f45130741df848c886f2f51ea2d3b9d0/FLAGb80a36839 [2022-10-16 12:04:43,021 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:04:43,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem2.i [2022-10-16 12:04:43,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763356dde/f45130741df848c886f2f51ea2d3b9d0/FLAGb80a36839 [2022-10-16 12:04:43,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/763356dde/f45130741df848c886f2f51ea2d3b9d0 [2022-10-16 12:04:43,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:04:43,328 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:04:43,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:04:43,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:04:43,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:04:43,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af71ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43, skipping insertion in model container [2022-10-16 12:04:43,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:04:43,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:04:43,750 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/heap-data/shared_mem2.i[23827,23840] [2022-10-16 12:04:43,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:04:43,761 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:04:43,822 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/heap-data/shared_mem2.i[23827,23840] [2022-10-16 12:04:43,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:04:43,875 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:04:43,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43 WrapperNode [2022-10-16 12:04:43,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:04:43,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:04:43,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:04:43,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:04:43,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,980 INFO L138 Inliner]: procedures = 121, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 75 [2022-10-16 12:04:43,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:04:43,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:04:43,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:04:43,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:04:43,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:43,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:44,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:44,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:44,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:44,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:44,050 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:44,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:44,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:04:44,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:04:44,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:04:44,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:04:44,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (1/1) ... [2022-10-16 12:04:44,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:04:44,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:04:44,118 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 12:04:44,143 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 12:04:44,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:04:44,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:04:44,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 12:04:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:04:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 12:04:44,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 12:04:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:04:44,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:04:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:04:44,418 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:04:44,423 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:04:44,632 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:04:44,639 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:04:44,640 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-16 12:04:44,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:44 BoogieIcfgContainer [2022-10-16 12:04:44,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:04:44,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:04:44,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:04:44,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:04:44,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:04:43" (1/3) ... [2022-10-16 12:04:44,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10196784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:44, skipping insertion in model container [2022-10-16 12:04:44,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:04:43" (2/3) ... [2022-10-16 12:04:44,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10196784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:04:44, skipping insertion in model container [2022-10-16 12:04:44,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:04:44" (3/3) ... [2022-10-16 12:04:44,652 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2.i [2022-10-16 12:04:44,673 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:04:44,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-10-16 12:04:44,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:04:44,743 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;@6634f535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:04:44,743 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-10-16 12:04:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 12:04:44,756 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:44,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:44,758 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1819221431, now seen corresponding path program 1 times [2022-10-16 12:04:44,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:44,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936604790] [2022-10-16 12:04:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:44,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:45,100 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 12:04:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:45,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936604790] [2022-10-16 12:04:45,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936604790] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:04:45,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:04:45,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:04:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081927353] [2022-10-16 12:04:45,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:04:45,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 12:04:45,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:45,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 12:04:45,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 12:04:45,152 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:45,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:45,169 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-10-16 12:04:45,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 12:04:45,171 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 12:04:45,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:45,180 INFO L225 Difference]: With dead ends: 41 [2022-10-16 12:04:45,181 INFO L226 Difference]: Without dead ends: 18 [2022-10-16 12:04:45,184 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 12:04:45,189 INFO L413 NwaCegarLoop]: 26 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, 26 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 12:04:45,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 12:04:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-10-16 12:04:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-10-16 12:04:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.5) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-10-16 12:04:45,230 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 7 [2022-10-16 12:04:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:45,231 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-10-16 12:04:45,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-10-16 12:04:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 12:04:45,232 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:45,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:45,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:04:45,233 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:45,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash 177874540, now seen corresponding path program 1 times [2022-10-16 12:04:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:45,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785371578] [2022-10-16 12:04:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:45,930 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 12:04:45,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:45,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785371578] [2022-10-16 12:04:45,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785371578] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:04:45,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:04:45,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:04:45,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115297954] [2022-10-16 12:04:45,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:04:45,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:04:45,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:45,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:04:45,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:04:45,938 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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 12:04:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:46,204 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-10-16 12:04:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:04:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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 12:04:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:46,206 INFO L225 Difference]: With dead ends: 44 [2022-10-16 12:04:46,206 INFO L226 Difference]: Without dead ends: 32 [2022-10-16 12:04:46,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-10-16 12:04:46,209 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:46,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 54 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 12:04:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-16 12:04:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2022-10-16 12:04:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.434782608695652) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-10-16 12:04:46,218 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 8 [2022-10-16 12:04:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:46,219 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-10-16 12:04:46,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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 12:04:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-10-16 12:04:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 12:04:46,220 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:46,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:46,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:04:46,221 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1219143510, now seen corresponding path program 1 times [2022-10-16 12:04:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:46,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042416546] [2022-10-16 12:04:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:46,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:46,766 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 12:04:46,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:46,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042416546] [2022-10-16 12:04:46,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042416546] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:04:46,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:04:46,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:04:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386335020] [2022-10-16 12:04:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:04:46,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:04:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:46,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:04:46,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:04:46,770 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:46,980 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-10-16 12:04:46,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:04:46,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-16 12:04:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:46,982 INFO L225 Difference]: With dead ends: 32 [2022-10-16 12:04:46,982 INFO L226 Difference]: Without dead ends: 31 [2022-10-16 12:04:46,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-16 12:04:46,984 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:46,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:04:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-10-16 12:04:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-10-16 12:04:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.391304347826087) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-10-16 12:04:46,994 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 9 [2022-10-16 12:04:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:46,995 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-10-16 12:04:46,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-10-16 12:04:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 12:04:46,996 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:46,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:46,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:04:46,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:47,000 INFO L85 PathProgramCache]: Analyzing trace with hash -929156488, now seen corresponding path program 1 times [2022-10-16 12:04:47,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:47,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406463684] [2022-10-16 12:04:47,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:47,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:47,204 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 12:04:47,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:47,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406463684] [2022-10-16 12:04:47,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406463684] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:04:47,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:04:47,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:04:47,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654248373] [2022-10-16 12:04:47,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:04:47,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:04:47,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:47,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:04:47,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:04:47,211 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:47,270 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-10-16 12:04:47,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:04:47,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-16 12:04:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:47,272 INFO L225 Difference]: With dead ends: 27 [2022-10-16 12:04:47,272 INFO L226 Difference]: Without dead ends: 26 [2022-10-16 12:04:47,273 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 12:04:47,275 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:47,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:04:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-16 12:04:47,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-16 12:04:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 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 12:04:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-10-16 12:04:47,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 11 [2022-10-16 12:04:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:47,283 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-10-16 12:04:47,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-10-16 12:04:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 12:04:47,284 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:47,284 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:47,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:04:47,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash 45638864, now seen corresponding path program 1 times [2022-10-16 12:04:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:47,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197346606] [2022-10-16 12:04:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:48,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:48,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197346606] [2022-10-16 12:04:48,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197346606] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:04:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859662342] [2022-10-16 12:04:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:48,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:48,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:04:48,284 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 12:04:48,305 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 12:04:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:48,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 48 conjunts are in the unsatisfiable core [2022-10-16 12:04:48,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:04:48,585 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-10-16 12:04:48,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-10-16 12:04:48,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:04:48,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-10-16 12:04:48,734 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 79 treesize of output 46 [2022-10-16 12:04:48,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:48,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2022-10-16 12:04:48,773 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 18 treesize of output 19 [2022-10-16 12:04:48,793 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 18 treesize of output 19 [2022-10-16 12:04:48,815 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 12:04:48,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-16 12:04:49,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,126 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 26 treesize of output 23 [2022-10-16 12:04:49,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,148 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 26 treesize of output 23 [2022-10-16 12:04:49,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 74 [2022-10-16 12:04:49,187 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 12:04:49,187 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 11 treesize of output 11 [2022-10-16 12:04:49,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,220 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 12:04:49,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 79 [2022-10-16 12:04:49,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-10-16 12:04:49,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-10-16 12:04:49,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:49,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-10-16 12:04:49,454 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 31 treesize of output 23 [2022-10-16 12:04:49,462 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:04:49,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2022-10-16 12:04:49,469 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 7 treesize of output 3 [2022-10-16 12:04:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:49,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:04:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:49,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859662342] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:04:49,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:04:49,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-10-16 12:04:49,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767610136] [2022-10-16 12:04:49,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:04:49,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 12:04:49,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 12:04:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-10-16 12:04:49,910 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 17 states, 16 states have (on average 1.9375) internal successors, (31), 17 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 12:04:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:50,417 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-10-16 12:04:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 12:04:50,418 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 17 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 11 [2022-10-16 12:04:50,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:50,419 INFO L225 Difference]: With dead ends: 50 [2022-10-16 12:04:50,419 INFO L226 Difference]: Without dead ends: 39 [2022-10-16 12:04:50,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2022-10-16 12:04:50,424 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:50,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 112 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 123 Invalid, 0 Unknown, 15 Unchecked, 0.1s Time] [2022-10-16 12:04:50,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-16 12:04:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-10-16 12:04:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 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 12:04:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-10-16 12:04:50,439 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 11 [2022-10-16 12:04:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:50,440 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-10-16 12:04:50,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.9375) internal successors, (31), 17 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 12:04:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-10-16 12:04:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 12:04:50,441 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:50,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:50,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 12:04:50,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:50,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:50,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1260920017, now seen corresponding path program 1 times [2022-10-16 12:04:50,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:50,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646145006] [2022-10-16 12:04:50,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:50,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:50,780 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 12:04:50,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:50,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646145006] [2022-10-16 12:04:50,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646145006] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:04:50,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:04:50,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:04:50,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537630145] [2022-10-16 12:04:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:04:50,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:04:50,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:04:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:04:50,783 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:50,846 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-10-16 12:04:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:04:50,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 12:04:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:50,848 INFO L225 Difference]: With dead ends: 34 [2022-10-16 12:04:50,848 INFO L226 Difference]: Without dead ends: 33 [2022-10-16 12:04:50,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:04:50,849 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:50,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:04:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-16 12:04:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-16 12:04:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-10-16 12:04:50,857 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 12 [2022-10-16 12:04:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:50,858 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-10-16 12:04:50,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:04:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-10-16 12:04:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 12:04:50,859 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:50,859 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:50,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:04:50,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1414804850, now seen corresponding path program 1 times [2022-10-16 12:04:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:50,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657776545] [2022-10-16 12:04:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:51,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:51,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657776545] [2022-10-16 12:04:51,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657776545] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:04:51,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81945742] [2022-10-16 12:04:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:51,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:51,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:04:51,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 12:04:51,802 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 12:04:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:51,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 12:04:51,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:04:51,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:51,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:51,946 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-10-16 12:04:51,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:51,967 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 30 treesize of output 30 [2022-10-16 12:04:51,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:51,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:51,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:04:51,985 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 18 treesize of output 19 [2022-10-16 12:04:51,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-10-16 12:04:52,010 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-10-16 12:04:52,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 30 [2022-10-16 12:04:52,023 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 18 treesize of output 19 [2022-10-16 12:04:52,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:52,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:52,180 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 51 treesize of output 44 [2022-10-16 12:04:52,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:52,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:52,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-10-16 12:04:52,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:52,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:52,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:52,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-10-16 12:04:52,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:52,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-10-16 12:04:52,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:52,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-10-16 12:04:52,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:52,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 35 [2022-10-16 12:04:52,283 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-10-16 12:04:52,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 22 treesize of output 24 [2022-10-16 12:04:52,396 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 35 treesize of output 23 [2022-10-16 12:04:52,404 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-10-16 12:04:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:52,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:04:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:52,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81945742] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:04:52,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:04:52,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-10-16 12:04:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68437743] [2022-10-16 12:04:52,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:04:52,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-16 12:04:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:52,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-16 12:04:52,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-10-16 12:04:52,714 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 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 12:04:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:04:53,458 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-10-16 12:04:53,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 12:04:53,459 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 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 12 [2022-10-16 12:04:53,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:04:53,461 INFO L225 Difference]: With dead ends: 62 [2022-10-16 12:04:53,461 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 12:04:53,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-10-16 12:04:53,463 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 139 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 12:04:53,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 79 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 116 Invalid, 0 Unknown, 32 Unchecked, 0.3s Time] [2022-10-16 12:04:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 12:04:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 36. [2022-10-16 12:04:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 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 12:04:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-10-16 12:04:53,473 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 12 [2022-10-16 12:04:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:04:53,474 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-10-16 12:04:53,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 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 12:04:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-10-16 12:04:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 12:04:53,475 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:04:53,475 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:04:53,513 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 12:04:53,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-16 12:04:53,691 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:04:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:04:53,693 INFO L85 PathProgramCache]: Analyzing trace with hash -902374420, now seen corresponding path program 2 times [2022-10-16 12:04:53,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:04:53,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130228900] [2022-10-16 12:04:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:04:53,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:04:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:04:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 12:04:54,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:04:54,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130228900] [2022-10-16 12:04:54,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130228900] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:04:54,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603419554] [2022-10-16 12:04:54,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 12:04:54,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:04:54,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:04:54,882 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 12:04:54,904 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 12:04:55,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 12:04:55,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 12:04:55,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 93 conjunts are in the unsatisfiable core [2022-10-16 12:04:55,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:04:55,096 INFO L356 Elim1Store]: treesize reduction 46, result has 29.2 percent of original size [2022-10-16 12:04:55,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 94 [2022-10-16 12:04:55,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:04:55,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2022-10-16 12:04:55,218 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 72 treesize of output 41 [2022-10-16 12:04:55,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2022-10-16 12:04:55,236 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 18 treesize of output 19 [2022-10-16 12:04:55,246 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 18 treesize of output 19 [2022-10-16 12:04:55,269 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 12:04:55,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-16 12:04:55,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 39 treesize of output 34 [2022-10-16 12:04:55,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 39 treesize of output 34 [2022-10-16 12:04:55,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,566 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-10-16 12:04:55,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-10-16 12:04:55,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,594 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-10-16 12:04:55,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,610 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 12:04:55,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-10-16 12:04:55,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,663 INFO L356 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2022-10-16 12:04:55,664 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 97 [2022-10-16 12:04:55,696 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-16 12:04:55,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-16 12:04:55,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-10-16 12:04:55,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:55,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-10-16 12:04:56,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 39 treesize of output 34 [2022-10-16 12:04:56,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:56,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:56,067 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 12:04:56,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 57 [2022-10-16 12:04:56,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:56,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:56,108 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 12:04:56,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2022-10-16 12:04:56,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:56,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:56,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2022-10-16 12:04:56,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:56,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-10-16 12:04:56,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:56,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-10-16 12:04:56,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:04:56,172 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-16 12:04:56,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 42 [2022-10-16 12:04:56,211 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 12:04:56,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-16 12:04:56,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 12:04:56,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-16 12:04:57,748 INFO L356 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-10-16 12:04:57,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 54 [2022-10-16 12:04:57,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:04:57,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2022-10-16 12:04:57,763 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 7 treesize of output 3 [2022-10-16 12:04:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:04:57,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:04:57,980 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:04:57,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 106 [2022-10-16 12:04:58,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:04:58,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 297 treesize of output 274 [2022-10-16 12:04:58,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:04:58,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 257 treesize of output 234 [2022-10-16 12:04:58,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_9| Int) (|v_ULTIMATE.start_main_~n~0#1.offset_8| Int) (v_ArrVal_640 (Array Int Int)) (v_ArrVal_634 Int) (v_ArrVal_643 (Array Int Int)) (v_ArrVal_621 Int) (v_ArrVal_631 Int) (v_ArrVal_652 Int) (v_ArrVal_630 Int) (v_ArrVal_651 Int) (v_ArrVal_649 (Array Int Int)) (v_ArrVal_650 Int) (v_ArrVal_617 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_8| Int) (v_arrayElimArr_9 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_9| Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse0 (let ((.cse9 (store (let ((.cse10 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_617))) (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2 v_ArrVal_621))) |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_649))) (store .cse9 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2 v_ArrVal_650)))) (.cse7 (+ |v_ULTIMATE.start_main_~n~0#1.offset_9| 4)) (.cse8 (+ |v_ULTIMATE.start_main_~n~0#1.offset_9| 8))) (or (not (= (select v_arrayElimArr_9 (+ |v_ULTIMATE.start_main_~n~0#1.offset_8| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_9| v_ArrVal_631) |v_ULTIMATE.start_main_~n~0#1.base_8|) 0)) (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (let ((.cse4 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse0 (select (select (let ((.cse1 (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_9| v_arrayElimArr_10))) (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2 v_ArrVal_634))) |v_ULTIMATE.start_main_~n~0#1.base_8| v_arrayElimArr_9))) (store .cse1 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2 v_ArrVal_652))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_9| v_arrayElimArr_11))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse2 v_ArrVal_630))))) (store (store .cse5 |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_640) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse5 |v_ULTIMATE.start_main_~n~0#1.base_8| v_ArrVal_643) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2 v_ArrVal_651))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)))) 2147483648) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_11 .cse7))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_9|) 0)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_9 (+ |v_ULTIMATE.start_main_~n~0#1.offset_8| 4)))) (< 99 (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_10 .cse7))) (not (= (select v_arrayElimArr_10 .cse8) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select v_arrayElimArr_11 .cse8) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-10-16 12:04:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-10-16 12:04:58,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603419554] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:04:58,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:04:58,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2022-10-16 12:04:58,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214974301] [2022-10-16 12:04:58,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:04:58,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-16 12:04:58,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:04:58,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-16 12:04:58,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=253, Unknown=3, NotChecked=32, Total=342 [2022-10-16 12:04:58,895 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 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 12:05:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:05:01,629 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-10-16 12:05:01,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 12:05:01,631 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 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 14 [2022-10-16 12:05:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:05:01,632 INFO L225 Difference]: With dead ends: 57 [2022-10-16 12:05:01,632 INFO L226 Difference]: Without dead ends: 47 [2022-10-16 12:05:01,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=115, Invalid=486, Unknown=3, NotChecked=46, Total=650 [2022-10-16 12:05:01,638 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:05:01,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 87 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-10-16 12:05:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-16 12:05:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-10-16 12:05:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-10-16 12:05:01,657 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 14 [2022-10-16 12:05:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:05:01,657 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-10-16 12:05:01,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 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 12:05:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-10-16 12:05:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 12:05:01,658 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:05:01,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:05:01,699 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 12:05:01,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:01,873 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:05:01,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:05:01,874 INFO L85 PathProgramCache]: Analyzing trace with hash 224340639, now seen corresponding path program 1 times [2022-10-16 12:05:01,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:05:01,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498119119] [2022-10-16 12:05:01,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:01,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:05:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:02,977 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 12:05:02,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:05:02,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498119119] [2022-10-16 12:05:02,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498119119] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:05:02,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201809254] [2022-10-16 12:05:02,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:02,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:02,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:05:02,981 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 12:05:02,982 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 12:05:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:03,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 56 conjunts are in the unsatisfiable core [2022-10-16 12:05:03,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:05:03,114 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 18 treesize of output 19 [2022-10-16 12:05:03,120 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 18 treesize of output 19 [2022-10-16 12:05:03,128 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 12:05:03,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:03,140 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 24 treesize of output 24 [2022-10-16 12:05:03,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:03,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:03,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:05:03,504 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 12:05:03,505 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2022-10-16 12:05:03,511 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 30 [2022-10-16 12:05:03,522 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 31 [2022-10-16 12:05:03,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2022-10-16 12:05:03,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-10-16 12:05:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-16 12:05:03,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:05:03,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem12#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem12#1.base|) |c_ULTIMATE.start_main_#t~mem12#1.offset| v_ArrVal_742)))) (or (< 99 (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_740)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_741)) (.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (+ (select (select .cse0 .cse1) .cse2) (let ((.cse4 (+ .cse2 4))) (select (select .cse0 (select (select .cse3 .cse1) .cse4)) (select (select .cse5 .cse1) .cse4)))))) 2147483648)))) is different from false [2022-10-16 12:05:03,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse0 (store |c_#memory_int| .cse7 (store (select |c_#memory_int| .cse7) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8) v_ArrVal_742)))) (or (< 99 (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_740)) (.cse1 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_741)) (.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (+ (let ((.cse3 (+ .cse5 4))) (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))) (select (select .cse0 .cse2) .cse5)))) 2147483648)))))) is different from false [2022-10-16 12:05:03,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse0 (store |c_#memory_int| .cse7 (store (select |c_#memory_int| .cse7) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8) v_ArrVal_742)))) (or (< 99 (select (select .cse0 |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_740)) (.cse3 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_741)) (.cse6 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse6)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (+ (select (select .cse0 .cse1) .cse2) (let ((.cse4 (+ .cse2 4))) (select (select .cse0 (select (select .cse3 .cse1) .cse4)) (select (select .cse5 .cse1) .cse4)))))) 2147483648)))))) is different from false [2022-10-16 12:05:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-10-16 12:05:04,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201809254] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:05:04,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:05:04,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 8] total 21 [2022-10-16 12:05:04,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647278926] [2022-10-16 12:05:04,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:05:04,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-16 12:05:04,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:05:04,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-16 12:05:04,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=284, Unknown=3, NotChecked=108, Total=462 [2022-10-16 12:05:04,043 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 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 12:05:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:05:05,688 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-10-16 12:05:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 12:05:05,689 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 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 16 [2022-10-16 12:05:05,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:05:05,704 INFO L225 Difference]: With dead ends: 58 [2022-10-16 12:05:05,704 INFO L226 Difference]: Without dead ends: 57 [2022-10-16 12:05:05,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=193, Invalid=746, Unknown=3, NotChecked=180, Total=1122 [2022-10-16 12:05:05,712 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 44 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 12:05:05,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 110 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 149 Invalid, 0 Unknown, 77 Unchecked, 0.4s Time] [2022-10-16 12:05:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-16 12:05:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-10-16 12:05:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.297872340425532) internal successors, (61), 48 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 12:05:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-10-16 12:05:05,739 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 16 [2022-10-16 12:05:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:05:05,739 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-10-16 12:05:05,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 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 12:05:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-10-16 12:05:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 12:05:05,743 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:05:05,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:05:05,784 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 12:05:05,957 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 12:05:05,958 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:05:05,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:05:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1635374717, now seen corresponding path program 1 times [2022-10-16 12:05:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:05:05,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991295237] [2022-10-16 12:05:05,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:05,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:05:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:06,859 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 12:05:06,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:05:06,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991295237] [2022-10-16 12:05:06,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991295237] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:05:06,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307222768] [2022-10-16 12:05:06,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:06,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:06,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:05:06,863 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 12:05:06,868 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 12:05:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:06,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 54 conjunts are in the unsatisfiable core [2022-10-16 12:05:06,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:05:06,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:06,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:06,995 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 24 treesize of output 24 [2022-10-16 12:05:06,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:07,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-10-16 12:05:07,003 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 16 treesize of output 14 [2022-10-16 12:05:07,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:07,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:07,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:05:07,016 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 18 treesize of output 19 [2022-10-16 12:05:07,234 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 12:05:07,235 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 1 case distinctions, treesize of input 73 treesize of output 68 [2022-10-16 12:05:07,241 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 30 [2022-10-16 12:05:07,249 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 43 treesize of output 43 [2022-10-16 12:05:09,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2022-10-16 12:05:09,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2022-10-16 12:05:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:05:09,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:05:09,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_830 (Array Int Int))) (or (< (+ v_ArrVal_828 2147483648) 0) (< 0 (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_830)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_827)) (.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem12#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem12#1.base|) |c_ULTIMATE.start_main_#t~mem12#1.offset| v_ArrVal_828))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (+ 2147483649 (let ((.cse3 (+ .cse5 4))) (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))) (select (select .cse0 .cse2) .cse5))))))) is different from false [2022-10-16 12:05:09,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_830 (Array Int Int))) (or (< (+ v_ArrVal_828 2147483648) 0) (< 0 (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_830)) (.cse1 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_827)) (.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_int| .cse7 (store (select |c_#memory_int| .cse7) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8) v_ArrVal_828))) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (+ 2147483649 (let ((.cse3 (+ .cse5 4))) (select (select .cse0 (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))) (select (select .cse0 .cse2) .cse5))))))))) is different from false [2022-10-16 12:05:09,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_827 (Array Int Int)) (v_ArrVal_828 Int) (v_ArrVal_830 (Array Int Int))) (or (< (+ v_ArrVal_828 2147483648) 0) (< 0 (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_830)) (.cse3 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_827)) (.cse6 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_int| .cse7 (store (select |c_#memory_int| .cse7) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8) v_ArrVal_828))) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse6)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (+ 2147483649 (select (select .cse0 .cse1) .cse2) (let ((.cse4 (+ .cse2 4))) (select (select .cse0 (select (select .cse3 .cse1) .cse4)) (select (select .cse5 .cse1) .cse4))))))))))) is different from false [2022-10-16 12:05:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-10-16 12:05:09,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307222768] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:05:09,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:05:09,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 19 [2022-10-16 12:05:09,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147454212] [2022-10-16 12:05:09,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:05:09,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 12:05:09,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:05:09,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 12:05:09,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=228, Unknown=3, NotChecked=96, Total=380 [2022-10-16 12:05:09,716 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:05:10,890 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2022-10-16 12:05:10,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 12:05:10,890 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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 12:05:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:05:10,891 INFO L225 Difference]: With dead ends: 68 [2022-10-16 12:05:10,891 INFO L226 Difference]: Without dead ends: 35 [2022-10-16 12:05:10,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=139, Invalid=470, Unknown=3, NotChecked=144, Total=756 [2022-10-16 12:05:10,893 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 12:05:10,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 105 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 187 Invalid, 0 Unknown, 81 Unchecked, 0.4s Time] [2022-10-16 12:05:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-16 12:05:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-10-16 12:05:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-10-16 12:05:10,901 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-10-16 12:05:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:05:10,901 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-10-16 12:05:10,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-10-16 12:05:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 12:05:10,902 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:05:10,903 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:05:10,947 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 12:05:11,103 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 12:05:11,104 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:05:11,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:05:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash -476435726, now seen corresponding path program 2 times [2022-10-16 12:05:11,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:05:11,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962410787] [2022-10-16 12:05:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:05:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-16 12:05:13,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:05:13,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962410787] [2022-10-16 12:05:13,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962410787] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:05:13,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902608870] [2022-10-16 12:05:13,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 12:05:13,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:13,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:05:13,137 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 12:05:13,165 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 12:05:13,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 12:05:13,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 12:05:13,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 120 conjunts are in the unsatisfiable core [2022-10-16 12:05:13,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:05:13,353 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 12:05:13,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 18 [2022-10-16 12:05:13,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-10-16 12:05:13,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,379 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-10-16 12:05:13,387 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 30 treesize of output 30 [2022-10-16 12:05:13,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-10-16 12:05:13,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2022-10-16 12:05:13,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-10-16 12:05:13,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-10-16 12:05:13,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 39 treesize of output 34 [2022-10-16 12:05:13,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-10-16 12:05:13,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-10-16 12:05:13,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-10-16 12:05:13,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2022-10-16 12:05:13,628 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-10-16 12:05:13,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 22 treesize of output 33 [2022-10-16 12:05:13,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-10-16 12:05:13,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 [2022-10-16 12:05:13,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,935 INFO L356 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2022-10-16 12:05:13,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 99 [2022-10-16 12:05:13,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,976 INFO L356 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2022-10-16 12:05:13,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 79 [2022-10-16 12:05:13,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:13,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-10-16 12:05:14,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-10-16 12:05:14,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:14,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 63 treesize of output 55 [2022-10-16 12:05:14,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 23 [2022-10-16 12:05:14,106 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-10-16 12:05:14,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-10-16 12:05:14,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:14,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 26 [2022-10-16 12:05:14,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2022-10-16 12:05:14,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:14,326 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 76 treesize of output 48 [2022-10-16 12:05:14,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 52 [2022-10-16 12:05:14,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:14,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-10-16 12:05:15,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:15,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:15,089 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 12:05:15,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 67 [2022-10-16 12:05:15,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:15,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:15,129 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 12:05:15,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 83 [2022-10-16 12:05:15,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:15,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:15,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:15,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2022-10-16 12:05:15,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:15,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 [2022-10-16 12:05:15,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:15,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 26 [2022-10-16 12:05:15,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:15,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 40 [2022-10-16 12:05:15,237 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-10-16 12:05:15,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-10-16 12:05:15,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2022-10-16 12:05:15,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-10-16 12:05:15,517 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 39 treesize of output 27 [2022-10-16 12:05:15,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-10-16 12:05:15,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:05:15,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:05:15,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:15,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 298 treesize of output 275 [2022-10-16 12:05:15,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:15,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 258 treesize of output 235 [2022-10-16 12:05:15,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1130 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_15| Int) (v_ArrVal_1123 Int) (v_ArrVal_1136 Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 Int) (v_ArrVal_1107 Int) (v_ArrVal_1118 Int) (|v_ULTIMATE.start_main_~n~0#1.base_16| Int) (|v_ULTIMATE.start_main_~n~0#1.base_15| Int) (v_ArrVal_1109 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_main_~n~0#1.offset_15| 8)) (.cse1 (+ |v_ULTIMATE.start_main_~n~0#1.offset_15| 4))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_15 .cse0))) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_15 .cse1))) (not (= (select v_arrayElimArr_16 .cse1) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_1109) |v_ULTIMATE.start_main_~n~0#1.base_15|) 0)) (< 0 (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse2 (let ((.cse9 (store (let ((.cse10 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_1116))) (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1107))) |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1125))) (store .cse9 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1137))))) (+ 2147483649 (let ((.cse6 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse2 (select (select (let ((.cse3 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_16| v_arrayElimArr_15))) (store .cse5 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1123))))) (store (store .cse3 |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1131) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse3 |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1129) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1135))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6)) (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_16| v_arrayElimArr_16))) (store .cse8 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1118))))) (store (store .cse7 |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1132) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse7 |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1130) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1136))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse6))) (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_16|) 0))))) is different from false [2022-10-16 12:05:16,241 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:16,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 634 treesize of output 571 [2022-10-16 12:05:16,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:16,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 554 treesize of output 491 [2022-10-16 12:05:16,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1132 (Array Int Int)) (v_ArrVal_1131 (Array Int Int)) (v_ArrVal_1130 (Array Int Int)) (v_ArrVal_1095 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_15| Int) (v_ArrVal_1123 Int) (v_ArrVal_1089 Int) (v_arrayElimArr_18 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_16| Int) (v_ArrVal_1107 Int) (v_ArrVal_1109 Int) (v_ArrVal_1129 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_1125 (Array Int Int)) (v_arrayElimArr_16 (Array Int Int)) (v_ArrVal_1090 Int) (v_ArrVal_1093 Int) (v_ArrVal_1098 Int) (v_ArrVal_1136 Int) (v_ArrVal_1135 Int) (v_ArrVal_1137 Int) (|v_ULTIMATE.start_main_~n~0#1.base_17| Int) (v_ArrVal_1118 Int) (|v_ULTIMATE.start_main_~n~0#1.base_16| Int) (|v_ULTIMATE.start_main_~n~0#1.base_15| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_main_~n~0#1.offset_15| 8)) (.cse1 (store |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_17| v_ArrVal_1093)) (.cse14 (+ |v_ULTIMATE.start_main_~n~0#1.offset_15| 4)) (.cse16 (+ |v_ULTIMATE.start_main_~n~0#1.offset_16| 8)) (.cse15 (+ |v_ULTIMATE.start_main_~n~0#1.offset_16| 4))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_15 .cse0))) (not (= (select .cse1 |v_ULTIMATE.start_main_~n~0#1.base_16|) 0)) (not (= (select v_arrayElimArr_16 .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (< 0 (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse2 (let ((.cse11 (store (let ((.cse12 (store (let ((.cse13 (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_17| v_ArrVal_1095))) (store .cse13 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1098))) |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_1116))) (store .cse12 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1107))) |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1125))) (store .cse11 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1137))))) (+ 2147483649 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (let ((.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (select (select .cse2 (select (select (let ((.cse3 (let ((.cse5 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_17| v_arrayElimArr_17))) (store .cse6 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1089))) |v_ULTIMATE.start_main_~n~0#1.base_16| v_arrayElimArr_15))) (store .cse5 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1123))))) (store (store .cse3 |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1131) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse3 |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1129) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1135))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (select (select (let ((.cse8 (let ((.cse9 (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_17| v_arrayElimArr_18))) (store .cse10 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1090))) |v_ULTIMATE.start_main_~n~0#1.base_16| v_arrayElimArr_16))) (store .cse9 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1118))))) (store (store .cse8 |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1132) |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store .cse8 |v_ULTIMATE.start_main_~n~0#1.base_15| v_ArrVal_1130) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_1136))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse7))))))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_15 .cse14))) (not (= |c_ULTIMATE.start_main_~m~0#1.base| (select v_arrayElimArr_17 .cse15))) (not (= (select (store .cse1 |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_1109) |v_ULTIMATE.start_main_~n~0#1.base_15|) 0)) (not (= (select v_arrayElimArr_16 .cse14) |c_ULTIMATE.start_main_~m~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_17|) 0)) (not (= (select v_arrayElimArr_18 .cse16) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select v_arrayElimArr_17 .cse16) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= |c_ULTIMATE.start_main_~m~0#1.offset| (select v_arrayElimArr_18 .cse15)))))) is different from false [2022-10-16 12:05:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-10-16 12:05:17,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902608870] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:05:17,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:05:17,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-10-16 12:05:17,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596075218] [2022-10-16 12:05:17,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:05:17,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 12:05:17,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:05:17,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 12:05:17,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=242, Unknown=2, NotChecked=66, Total=380 [2022-10-16 12:05:17,329 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:05:17,808 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-10-16 12:05:17,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:05:17,812 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-10-16 12:05:17,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:05:17,813 INFO L225 Difference]: With dead ends: 38 [2022-10-16 12:05:17,813 INFO L226 Difference]: Without dead ends: 37 [2022-10-16 12:05:17,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=351, Unknown=2, NotChecked=82, Total=552 [2022-10-16 12:05:17,814 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:05:17,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 73 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 72 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-10-16 12:05:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-10-16 12:05:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2022-10-16 12:05:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-10-16 12:05:17,826 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2022-10-16 12:05:17,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:05:17,826 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-10-16 12:05:17,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:05:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-10-16 12:05:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 12:05:17,829 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:05:17,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:05:17,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-10-16 12:05:18,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:18,041 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-10-16 12:05:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:05:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2061843197, now seen corresponding path program 1 times [2022-10-16 12:05:18,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:05:18,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264201765] [2022-10-16 12:05:18,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:18,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:05:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:05:20,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:05:20,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264201765] [2022-10-16 12:05:20,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264201765] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:05:20,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096066711] [2022-10-16 12:05:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:05:20,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:05:20,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:05:20,386 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 12:05:20,405 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 12:05:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:05:20,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 92 conjunts are in the unsatisfiable core [2022-10-16 12:05:20,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:05:20,543 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 18 treesize of output 19 [2022-10-16 12:05:20,549 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 18 treesize of output 19 [2022-10-16 12:05:20,564 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-16 12:05:20,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 18 [2022-10-16 12:05:20,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:20,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:20,682 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 38 treesize of output 33 [2022-10-16 12:05:20,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-10-16 12:05:20,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:20,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:20,701 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 50 treesize of output 43 [2022-10-16 12:05:20,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 39 [2022-10-16 12:05:20,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2022-10-16 12:05:20,728 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-10-16 12:05:20,729 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 20 treesize of output 32 [2022-10-16 12:05:20,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 39 [2022-10-16 12:05:20,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 27 [2022-10-16 12:05:20,768 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-10-16 12:05:20,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 36 [2022-10-16 12:05:21,329 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-10-16 12:05:21,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 175 [2022-10-16 12:05:21,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 53 [2022-10-16 12:05:21,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 64 [2022-10-16 12:05:21,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 12:05:21,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 12:05:21,590 INFO L356 Elim1Store]: treesize reduction 89, result has 3.3 percent of original size [2022-10-16 12:05:21,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 176 treesize of output 84 [2022-10-16 12:05:21,603 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-16 12:05:21,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 39 [2022-10-16 12:05:21,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-10-16 12:05:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:05:21,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:05:21,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1297 Int) (v_ArrVal_1299 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (or (< (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1299)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1298)) (.cse6 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem12#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_#t~mem12#1.base|) |c_ULTIMATE.start_main_#t~mem12#1.offset| v_ArrVal_1297))) (.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) .cse6))) (+ (select (select .cse0 .cse1) .cse2) (let ((.cse4 (+ .cse2 4))) (select (select .cse0 (select (select .cse3 .cse1) .cse4)) (select (select .cse5 .cse1) .cse4)))))) 2147483648) (not (<= v_ArrVal_1297 (+ |c_ULTIMATE.start_main_#t~mem14#1| |c_ULTIMATE.start_main_#t~mem13#1|))))) is different from false [2022-10-16 12:05:22,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:22,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1052 treesize of output 848 [2022-10-16 12:05:22,281 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:22,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 836 treesize of output 748 [2022-10-16 12:05:22,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:22,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 724 treesize of output 688 [2022-10-16 12:05:22,455 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:22,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 31583 treesize of output 28557 [2022-10-16 12:05:22,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:22,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40536 treesize of output 32662 [2022-10-16 12:05:26,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 12:05:26,807 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 951 treesize of output 941 [2022-10-16 12:05:29,242 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 942 treesize of output 926 [2022-10-16 12:05:32,016 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 942 treesize of output 926 [2022-10-16 12:05:36,795 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 942 treesize of output 926