/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:49:11,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:49:11,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:49:11,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:49:11,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:49:11,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:49:11,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:49:11,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:49:11,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:49:11,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:49:11,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:49:11,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:49:11,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:49:11,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:49:11,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:49:11,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:49:11,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:49:11,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:49:11,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:49:11,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:49:11,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:49:11,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:49:11,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:49:11,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:49:11,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:49:11,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:49:11,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:49:11,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:49:11,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:49:11,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:49:11,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:49:11,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:49:11,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:49:11,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:49:11,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:49:11,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:49:11,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:49:11,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:49:11,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:49:11,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:49:11,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:49:11,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:49:11,813 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:49:11,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:49:11,813 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:49:11,813 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:49:11,814 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:49:11,814 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:49:11,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:49:11,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:49:11,815 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:49:11,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:49:11,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:49:11,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:49:11,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:49:11,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:49:11,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:49:11,816 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:49:11,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:49:11,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:49:11,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:49:11,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:49:11,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:49:11,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:49:11,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:49:11,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:49:11,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:49:11,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:49:11,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:49:11,818 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:49:11,818 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:49:11,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:49:11,818 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:49:11,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:49:12,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:49:12,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:49:12,013 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:49:12,015 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:49:12,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list-1.i [2022-01-10 00:49:12,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36d0852c/fb6865356be7414ea15a64f286df3522/FLAG84e4a4370 [2022-01-10 00:49:12,471 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:49:12,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i [2022-01-10 00:49:12,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36d0852c/fb6865356be7414ea15a64f286df3522/FLAG84e4a4370 [2022-01-10 00:49:12,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36d0852c/fb6865356be7414ea15a64f286df3522 [2022-01-10 00:49:12,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:49:12,492 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:49:12,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:49:12,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:49:12,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:49:12,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c615509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12, skipping insertion in model container [2022-01-10 00:49:12,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:49:12,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:49:12,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i[23574,23587] [2022-01-10 00:49:12,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:49:12,758 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:49:12,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i[23574,23587] [2022-01-10 00:49:12,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:49:12,799 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:49:12,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12 WrapperNode [2022-01-10 00:49:12,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:49:12,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:49:12,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:49:12,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:49:12,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,827 INFO L137 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85 [2022-01-10 00:49:12,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:49:12,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:49:12,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:49:12,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:49:12,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:49:12,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:49:12,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:49:12,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:49:12,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (1/1) ... [2022-01-10 00:49:12,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:49:12,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:12,872 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-01-10 00:49:12,873 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-01-10 00:49:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-01-10 00:49:12,900 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-01-10 00:49:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:49:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:49:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:49:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:49:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:49:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:49:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:49:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:49:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:49:12,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:49:12,965 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:49:12,966 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:49:12,998 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-01-10 00:49:13,119 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:49:13,124 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:49:13,124 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 00:49:13,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:13 BoogieIcfgContainer [2022-01-10 00:49:13,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:49:13,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:49:13,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:49:13,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:49:13,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:49:12" (1/3) ... [2022-01-10 00:49:13,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0740f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:49:13, skipping insertion in model container [2022-01-10 00:49:13,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:49:12" (2/3) ... [2022-01-10 00:49:13,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0740f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:49:13, skipping insertion in model container [2022-01-10 00:49:13,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:49:13" (3/3) ... [2022-01-10 00:49:13,130 INFO L111 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2022-01-10 00:49:13,134 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:49:13,134 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:49:13,174 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:49:13,178 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:49:13,178 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:49:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.5) internal successors, (39), 28 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 00:49:13,214 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:13,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:13,215 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:13,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:13,233 INFO L85 PathProgramCache]: Analyzing trace with hash 930969484, now seen corresponding path program 1 times [2022-01-10 00:49:13,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:13,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993292350] [2022-01-10 00:49:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:13,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:13,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:13,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993292350] [2022-01-10 00:49:13,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993292350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:13,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:13,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:49:13,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651605586] [2022-01-10 00:49:13,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:13,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:49:13,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:49:13,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:49:13,434 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.5) internal successors, (39), 28 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 5.5) internal successors, (11), 2 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-01-10 00:49:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:13,451 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-01-10 00:49:13,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:49:13,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-01-10 00:49:13,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:13,457 INFO L225 Difference]: With dead ends: 46 [2022-01-10 00:49:13,458 INFO L226 Difference]: Without dead ends: 19 [2022-01-10 00:49:13,460 INFO L932 BasicCegarLoop]: 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-01-10 00:49:13,463 INFO L933 BasicCegarLoop]: 37 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, 37 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-01-10 00:49:13,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-10 00:49:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-10 00:49:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-01-10 00:49:13,486 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2022-01-10 00:49:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:13,486 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-01-10 00:49:13,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-01-10 00:49:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-01-10 00:49:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 00:49:13,488 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:13,488 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:13,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:49:13,489 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:13,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1797355599, now seen corresponding path program 1 times [2022-01-10 00:49:13,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:13,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203457646] [2022-01-10 00:49:13,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:13,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:13,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:13,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203457646] [2022-01-10 00:49:13,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203457646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:13,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:13,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:49:13,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40201464] [2022-01-10 00:49:13,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:13,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:49:13,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:13,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:49:13,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:49:13,582 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-01-10 00:49:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:13,608 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-01-10 00:49:13,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:49:13,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-01-10 00:49:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:13,610 INFO L225 Difference]: With dead ends: 47 [2022-01-10 00:49:13,610 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 00:49:13,612 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:49:13,613 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:13,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 00:49:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-01-10 00:49:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 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-01-10 00:49:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-01-10 00:49:13,618 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 12 [2022-01-10 00:49:13,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:13,618 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-01-10 00:49:13,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-01-10 00:49:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-01-10 00:49:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 00:49:13,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:13,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:13,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:49:13,619 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1797348655, now seen corresponding path program 1 times [2022-01-10 00:49:13,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:13,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945125205] [2022-01-10 00:49:13,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:13,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:13,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:13,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945125205] [2022-01-10 00:49:13,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945125205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:13,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:13,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:49:13,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837307904] [2022-01-10 00:49:13,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:13,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:49:13,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:13,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:49:13,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:49:13,678 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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-01-10 00:49:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:13,740 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-01-10 00:49:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:49:13,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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-01-10 00:49:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:13,742 INFO L225 Difference]: With dead ends: 57 [2022-01-10 00:49:13,742 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 00:49:13,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:49:13,748 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:13,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 56 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 00:49:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-01-10 00:49:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-01-10 00:49:13,758 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 12 [2022-01-10 00:49:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:13,758 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-01-10 00:49:13,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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-01-10 00:49:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-01-10 00:49:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 00:49:13,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:13,759 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:13,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:49:13,760 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:13,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1890563654, now seen corresponding path program 1 times [2022-01-10 00:49:13,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:13,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490438626] [2022-01-10 00:49:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:13,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:13,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:13,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490438626] [2022-01-10 00:49:13,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490438626] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:13,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579972685] [2022-01-10 00:49:13,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:13,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:13,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:13,903 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-01-10 00:49:13,904 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-01-10 00:49:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:13,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-10 00:49:13,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:14,032 INFO L387 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 6 treesize of output 5 [2022-01-10 00:49:14,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:49:14,163 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:49:14,163 INFO L387 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-01-10 00:49:14,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:14,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-10 00:49:14,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:49:14,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:49:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:14,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:14,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_76 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_76) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-01-10 00:49:14,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_76 (Array Int Int)) (v_ArrVal_75 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_75)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_76) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-01-10 00:49:14,465 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-01-10 00:49:14,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-01-10 00:49:14,478 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:14,478 INFO L387 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 30 treesize of output 33 [2022-01-10 00:49:14,487 INFO L387 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 9 treesize of output 7 [2022-01-10 00:49:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 00:49:14,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579972685] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:14,614 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:14,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-01-10 00:49:14,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671381274] [2022-01-10 00:49:14,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:14,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 00:49:14,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:14,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 00:49:14,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=250, Unknown=2, NotChecked=66, Total=380 [2022-01-10 00:49:14,616 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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-01-10 00:49:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:18,966 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-01-10 00:49:18,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 00:49:18,967 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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) Word has length 18 [2022-01-10 00:49:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:18,967 INFO L225 Difference]: With dead ends: 62 [2022-01-10 00:49:18,967 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 00:49:18,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=171, Invalid=700, Unknown=7, NotChecked=114, Total=992 [2022-01-10 00:49:18,968 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:18,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 117 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 113 Invalid, 0 Unknown, 109 Unchecked, 0.1s Time] [2022-01-10 00:49:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 00:49:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2022-01-10 00:49:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-01-10 00:49:18,972 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 18 [2022-01-10 00:49:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:18,973 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-01-10 00:49:18,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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-01-10 00:49:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-01-10 00:49:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 00:49:18,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:18,974 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:18,993 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-01-10 00:49:19,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:19,184 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:19,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1672328945, now seen corresponding path program 1 times [2022-01-10 00:49:19,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:19,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369156111] [2022-01-10 00:49:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:19,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:19,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:19,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369156111] [2022-01-10 00:49:19,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369156111] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:19,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482730703] [2022-01-10 00:49:19,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:19,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:19,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:19,332 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-01-10 00:49:19,333 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-01-10 00:49:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:19,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-10 00:49:19,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:19,394 INFO L387 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 6 treesize of output 5 [2022-01-10 00:49:19,446 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:49:19,447 INFO L387 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-01-10 00:49:19,474 INFO L387 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 13 treesize of output 9 [2022-01-10 00:49:19,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 00:49:19,527 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:49:19,527 INFO L387 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 64 treesize of output 61 [2022-01-10 00:49:19,531 INFO L387 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 29 treesize of output 19 [2022-01-10 00:49:19,535 INFO L387 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 32 treesize of output 34 [2022-01-10 00:49:19,573 INFO L387 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 21 [2022-01-10 00:49:19,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-01-10 00:49:19,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:49:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:19,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:19,622 INFO L387 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 79 treesize of output 57 [2022-01-10 00:49:19,638 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_126 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_126) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_128 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2022-01-10 00:49:19,656 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:19,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-01-10 00:49:19,662 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:19,662 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 35 [2022-01-10 00:49:19,665 INFO L387 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 11 treesize of output 7 [2022-01-10 00:49:19,690 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-10 00:49:19,690 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-01-10 00:49:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 00:49:19,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482730703] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:19,809 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:19,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-01-10 00:49:19,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814130364] [2022-01-10 00:49:19,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:19,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 00:49:19,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:19,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 00:49:19,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=262, Unknown=1, NotChecked=32, Total=342 [2022-01-10 00:49:19,810 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:20,071 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-01-10 00:49:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 00:49:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 00:49:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:20,076 INFO L225 Difference]: With dead ends: 75 [2022-01-10 00:49:20,076 INFO L226 Difference]: Without dead ends: 55 [2022-01-10 00:49:20,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=592, Unknown=1, NotChecked=50, Total=756 [2022-01-10 00:49:20,077 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:20,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 213 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 230 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-01-10 00:49:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-10 00:49:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-01-10 00:49:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 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-01-10 00:49:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-01-10 00:49:20,081 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 23 [2022-01-10 00:49:20,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:20,081 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-01-10 00:49:20,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-01-10 00:49:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 00:49:20,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:20,082 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:20,104 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-01-10 00:49:20,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:20,283 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:20,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1588811868, now seen corresponding path program 2 times [2022-01-10 00:49:20,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:20,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640722127] [2022-01-10 00:49:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:20,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:49:20,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:20,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640722127] [2022-01-10 00:49:20,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640722127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:49:20,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:49:20,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:49:20,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072856250] [2022-01-10 00:49:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:49:20,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:49:20,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:20,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:49:20,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:49:20,312 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:20,320 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-01-10 00:49:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:49:20,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 00:49:20,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:20,321 INFO L225 Difference]: With dead ends: 86 [2022-01-10 00:49:20,321 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 00:49:20,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:49:20,322 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:20,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:49:20,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 00:49:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2022-01-10 00:49:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-01-10 00:49:20,325 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 29 [2022-01-10 00:49:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:20,325 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-01-10 00:49:20,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-01-10 00:49:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 00:49:20,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:20,326 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:20,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:49:20,326 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:20,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:20,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1117807526, now seen corresponding path program 1 times [2022-01-10 00:49:20,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:20,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733099935] [2022-01-10 00:49:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:20,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:20,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:20,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733099935] [2022-01-10 00:49:20,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733099935] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:20,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964228381] [2022-01-10 00:49:20,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:20,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:20,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:20,645 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-01-10 00:49:20,646 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-01-10 00:49:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:20,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-10 00:49:20,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:20,724 INFO L387 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 6 treesize of output 5 [2022-01-10 00:49:20,793 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:49:20,794 INFO L387 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-01-10 00:49:20,835 INFO L387 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 13 treesize of output 9 [2022-01-10 00:49:20,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 00:49:20,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:49:20,897 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:49:20,897 INFO L387 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 26 treesize of output 26 [2022-01-10 00:49:20,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:20,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-01-10 00:49:21,018 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:49:21,019 INFO L387 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 125 treesize of output 116 [2022-01-10 00:49:21,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:21,024 INFO L387 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 51 treesize of output 44 [2022-01-10 00:49:21,027 INFO L387 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 0 case distinctions, treesize of input 81 treesize of output 59 [2022-01-10 00:49:21,099 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:49:21,099 INFO L387 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 72 treesize of output 72 [2022-01-10 00:49:21,115 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-01-10 00:49:21,115 INFO L387 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 2 case distinctions, treesize of input 65 treesize of output 70 [2022-01-10 00:49:21,127 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-01-10 00:49:21,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-01-10 00:49:21,197 INFO L387 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 23 treesize of output 11 [2022-01-10 00:49:21,211 INFO L387 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 68 treesize of output 60 [2022-01-10 00:49:21,311 INFO L387 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 116 treesize of output 98 [2022-01-10 00:49:22,305 INFO L387 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 86 treesize of output 62 [2022-01-10 00:49:22,309 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 00:49:22,309 INFO L387 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 46 [2022-01-10 00:49:22,453 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-10 00:49:22,454 INFO L387 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 25 [2022-01-10 00:49:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:22,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:24,612 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (or (= .cse0 3) (= .cse0 2)))))) is different from false [2022-01-10 00:49:24,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_249 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_249)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_40| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_40|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 .cse1) (= 2 .cse1)))))) is different from false [2022-01-10 00:49:24,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_248 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_249 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_249)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_40| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_40|) 0 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 0)) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= .cse1 3) (= .cse1 2)))))) is different from false [2022-01-10 00:49:24,723 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:24,724 INFO L387 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 1053 treesize of output 1023 [2022-01-10 00:49:24,734 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:24,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 827 treesize of output 730 [2022-01-10 00:49:28,123 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:28,175 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:28,295 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:34,553 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:34,608 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:34,712 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:40,390 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:40,434 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:40,551 INFO L387 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 8 treesize of output 4 [2022-01-10 00:49:46,193 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:46,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 612 treesize of output 543 [2022-01-10 00:49:46,203 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:46,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 543 treesize of output 433 [2022-01-10 00:49:46,222 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:46,223 INFO L387 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 1394 treesize of output 1295 [2022-01-10 00:49:46,247 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:46,247 INFO L387 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 1895 treesize of output 1838 [2022-01-10 00:49:46,271 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:46,272 INFO L387 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 1846 treesize of output 1810 [2022-01-10 00:49:46,298 INFO L387 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 1755 treesize of output 1723 [2022-01-10 00:49:46,315 INFO L387 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 1723 treesize of output 1715 [2022-01-10 00:49:46,331 INFO L387 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 1715 treesize of output 1707 [2022-01-10 00:49:46,346 INFO L387 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 1707 treesize of output 1691 [2022-01-10 00:49:46,365 INFO L387 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 1691 treesize of output 1683 [2022-01-10 00:49:46,387 INFO L387 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 1683 treesize of output 1679 [2022-01-10 00:49:46,402 INFO L387 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 1679 treesize of output 1671 [2022-01-10 00:49:46,417 INFO L387 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 1671 treesize of output 1655 [2022-01-10 00:49:46,432 INFO L387 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 1655 treesize of output 1651 [2022-01-10 00:49:46,447 INFO L387 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 1651 treesize of output 1643 [2022-01-10 00:49:46,464 INFO L387 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 1643 treesize of output 1627 [2022-01-10 00:49:46,479 INFO L387 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 1627 treesize of output 1619 [2022-01-10 00:49:46,493 INFO L387 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 1619 treesize of output 1603 [2022-01-10 00:49:46,507 INFO L387 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 1603 treesize of output 1587 [2022-01-10 00:49:46,521 INFO L387 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 1587 treesize of output 1555 [2022-01-10 00:49:46,535 INFO L387 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 1555 treesize of output 1539 [2022-01-10 00:49:46,554 INFO L387 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 1539 treesize of output 1531 [2022-01-10 00:49:46,569 INFO L387 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 1531 treesize of output 1515 [2022-01-10 00:49:46,582 INFO L387 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 1515 treesize of output 1483 [2022-01-10 00:49:46,598 INFO L387 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 1483 treesize of output 1451 [2022-01-10 00:49:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-10 00:49:47,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964228381] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:49:47,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:49:47,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 40 [2022-01-10 00:49:47,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502567883] [2022-01-10 00:49:47,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:49:47,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-10 00:49:47,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:49:47,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-10 00:49:47,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1167, Unknown=3, NotChecked=216, Total=1560 [2022-01-10 00:49:47,365 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:47,507 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse2 (select .cse3 .cse9)) (.cse1 (select .cse0 .cse9))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (= (select .cse0 4) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse2 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse3 4) |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_ArrVal_248 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_249 Int)) (let ((.cse7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse4 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse7 v_ArrVal_249)))) (store .cse8 |v_ULTIMATE.start_main_~p~0#1.base_40| (store (select .cse8 |v_ULTIMATE.start_main_~p~0#1.base_40|) 0 3))))) (let ((.cse5 (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse4 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse7 0)) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))) (or (not (= (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= .cse5 3) (= .cse5 2)))))) (= .cse1 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-01-10 00:49:47,513 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse7 (select .cse8 .cse9)) (.cse6 (select .cse5 .cse9))) (and (forall ((v_ArrVal_248 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_40| Int) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_249 Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 v_ArrVal_249)))) (store .cse4 |v_ULTIMATE.start_main_~p~0#1.base_40| (store (select .cse4 |v_ULTIMATE.start_main_~p~0#1.base_40|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))))) (let ((.cse1 (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_248) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3 |c_ULTIMATE.start_main_~t~0#1.offset|)) |v_ULTIMATE.start_main_~p~0#1.base_40| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= 3 .cse1) (= 2 .cse1)))))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= (select .cse5 4) |c_ULTIMATE.start_main_~p~0#1.base|) (not (= .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse7 |c_ULTIMATE.start_main_~p~0#1.offset|) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse7 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse8 4) |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse6 |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-01-10 00:49:49,516 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (select .cse6 .cse9)) (.cse1 (select .cse5 .cse9))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| .cse0) (+ .cse1 4)))) (and (= (select (select |c_#memory_int| .cse0) .cse1) 2) (= .cse2 0) (let ((.cse3 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse3) (let ((.cse4 (select .cse6 4))) (and (not (= .cse4 |c_ULTIMATE.start_main_~p~0#1.base|)) (not .cse3) (= (select (select |c_#memory_int| .cse4) (select .cse5 4)) 2))))) (not (= .cse0 |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse2) (= .cse1 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (or (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int))) (let ((.cse7 (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))))) (or (= .cse7 3) (= .cse7 2)))))))))) is different from false [2022-01-10 00:49:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:49:49,762 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-01-10 00:49:49,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 00:49:49,763 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 00:49:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:49:49,763 INFO L225 Difference]: With dead ends: 55 [2022-01-10 00:49:49,763 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 00:49:49,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=255, Invalid=1743, Unknown=6, NotChecked=546, Total=2550 [2022-01-10 00:49:49,765 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:49:49,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 189 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 185 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2022-01-10 00:49:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 00:49:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-01-10 00:49:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-01-10 00:49:49,768 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 29 [2022-01-10 00:49:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:49:49,769 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-01-10 00:49:49,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:49:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-01-10 00:49:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 00:49:49,769 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:49:49,769 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:49:49,786 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-01-10 00:49:49,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:49,975 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:49:49,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:49:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1947572814, now seen corresponding path program 1 times [2022-01-10 00:49:49,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:49:49,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836686073] [2022-01-10 00:49:49,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:49,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:49:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 00:49:50,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:49:50,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836686073] [2022-01-10 00:49:50,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836686073] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:49:50,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543636531] [2022-01-10 00:49:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:49:50,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:49:50,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:49:50,168 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-01-10 00:49:50,169 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-01-10 00:49:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:49:50,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-10 00:49:50,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:49:50,270 INFO L387 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 6 treesize of output 5 [2022-01-10 00:49:50,326 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:49:50,370 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:49:50,371 INFO L387 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-01-10 00:49:50,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:49:50,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-10 00:49:50,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:49:50,509 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 00:49:50,509 INFO L387 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 16 treesize of output 18 [2022-01-10 00:49:50,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:49:50,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:49:50,611 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:49:50,650 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 00:49:50,651 INFO L387 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 19 treesize of output 22 [2022-01-10 00:49:50,749 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 00:49:50,749 INFO L387 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 22 treesize of output 14 [2022-01-10 00:49:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:49:50,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:49:52,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| 3)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-01-10 00:49:52,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_370 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50|) |c_ULTIMATE.start_main_~t~0#1.offset| 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= .cse0 3)))) is different from false [2022-01-10 00:49:52,825 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_370 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-01-10 00:49:52,849 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 1) (= 3 .cse0)))) is different from false [2022-01-10 00:49:52,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.base_50| Int) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_370 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_367) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_370))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_50|) 0 3))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 3) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (= .cse0 1)))) is different from false [2022-01-10 00:49:53,068 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-01-10 00:49:53,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 73 [2022-01-10 00:49:53,093 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:49:53,093 INFO L387 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 8691 treesize of output 8457 [2022-01-10 00:49:53,139 INFO L387 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 8875 treesize of output 8363 [2022-01-10 00:49:53,328 INFO L387 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 8267 treesize of output 8011