./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:13:58,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:13:58,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:13:58,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:13:58,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:13:58,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:13:58,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:13:58,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:13:58,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:13:58,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:13:58,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:13:58,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:13:58,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:13:58,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:13:58,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:13:58,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:13:58,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:13:58,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:13:58,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:13:58,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:13:58,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:13:58,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:13:58,843 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:13:58,844 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:13:58,851 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:13:58,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:13:58,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:13:58,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:13:58,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:13:58,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:13:58,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:13:58,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:13:58,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:13:58,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:13:58,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:13:58,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:13:58,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:13:58,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:13:58,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:13:58,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:13:58,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:13:58,861 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:13:58,892 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:13:58,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:13:58,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:13:58,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:13:58,900 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:13:58,900 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:13:58,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:13:58,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:13:58,901 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:13:58,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:13:58,902 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:13:58,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:13:58,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:13:58,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:13:58,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:13:58,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:13:58,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:13:58,904 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:13:58,904 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:13:58,904 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:13:58,904 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:13:58,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:13:58,905 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:13:58,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:13:58,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:13:58,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:13:58,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:13:58,906 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:13:58,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:13:58,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:13:58,907 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:13:58,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:13:58,907 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:13:58,907 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:13:58,908 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:13:58,908 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2aebf3cfbf85ca5d76e40b9ce94a108ab82985532ad1ea09b88a009b3e11ff5a [2023-02-15 10:13:59,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:13:59,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:13:59,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:13:59,161 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:13:59,162 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:13:59,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina3.c [2023-02-15 10:14:00,200 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:14:00,377 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:14:00,377 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c [2023-02-15 10:14:00,382 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edac4d5e9/1b37872bc0f4427c969cce51d51ebcac/FLAG502f41c38 [2023-02-15 10:14:00,397 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edac4d5e9/1b37872bc0f4427c969cce51d51ebcac [2023-02-15 10:14:00,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:14:00,400 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:14:00,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:14:00,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:14:00,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:14:00,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9092d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00, skipping insertion in model container [2023-02-15 10:14:00,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:14:00,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:14:00,551 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2023-02-15 10:14:00,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:14:00,585 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:14:00,594 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina3.c[588,601] [2023-02-15 10:14:00,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:14:00,610 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:14:00,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00 WrapperNode [2023-02-15 10:14:00,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:14:00,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:14:00,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:14:00,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:14:00,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,637 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2023-02-15 10:14:00,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:14:00,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:14:00,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:14:00,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:14:00,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,658 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:14:00,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:14:00,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:14:00,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:14:00,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (1/1) ... [2023-02-15 10:14:00,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:14:00,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:00,695 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) [2023-02-15 10:14:00,696 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 [2023-02-15 10:14:00,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:14:00,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:14:00,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:14:00,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:14:00,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:14:00,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:14:00,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:14:00,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:14:00,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:14:00,805 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:14:00,806 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:14:01,006 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:14:01,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:14:01,012 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 10:14:01,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:14:01 BoogieIcfgContainer [2023-02-15 10:14:01,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:14:01,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:14:01,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:14:01,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:14:01,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:14:00" (1/3) ... [2023-02-15 10:14:01,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b334264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:14:01, skipping insertion in model container [2023-02-15 10:14:01,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:14:00" (2/3) ... [2023-02-15 10:14:01,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b334264 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:14:01, skipping insertion in model container [2023-02-15 10:14:01,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:14:01" (3/3) ... [2023-02-15 10:14:01,020 INFO L112 eAbstractionObserver]: Analyzing ICFG sina3.c [2023-02-15 10:14:01,033 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:14:01,033 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:14:01,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:14:01,071 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c5dc0fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:14:01,071 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:14:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:14:01,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:01,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:01,079 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2023-02-15 10:14:01,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:01,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517376160] [2023-02-15 10:14:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:01,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:01,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517376160] [2023-02-15 10:14:01,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517376160] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:14:01,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:14:01,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:14:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059767162] [2023-02-15 10:14:01,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:14:01,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:14:01,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:01,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:14:01,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:14:01,271 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:01,284 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2023-02-15 10:14:01,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:14:01,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 10:14:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:01,290 INFO L225 Difference]: With dead ends: 50 [2023-02-15 10:14:01,290 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 10:14:01,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:14:01,294 INFO L413 NwaCegarLoop]: 32 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, 32 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 [2023-02-15 10:14:01,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:14:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 10:14:01,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 10:14:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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) [2023-02-15 10:14:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 10:14:01,316 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2023-02-15 10:14:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:01,317 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 10:14:01,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 10:14:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 10:14:01,318 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:01,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:01,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:14:01,318 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2023-02-15 10:14:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:01,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405680636] [2023-02-15 10:14:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:01,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405680636] [2023-02-15 10:14:01,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405680636] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:14:01,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:14:01,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:14:01,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621841186] [2023-02-15 10:14:01,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:14:01,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:14:01,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:01,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:14:01,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:14:01,534 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:01,592 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-02-15 10:14:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:14:01,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 10:14:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:01,594 INFO L225 Difference]: With dead ends: 53 [2023-02-15 10:14:01,594 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 10:14:01,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:14:01,596 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:14:01,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:14:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 10:14:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2023-02-15 10:14:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-02-15 10:14:01,603 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2023-02-15 10:14:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:01,603 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-15 10:14:01,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:01,604 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-02-15 10:14:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 10:14:01,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:01,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:01,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:14:01,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:01,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:01,606 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2023-02-15 10:14:01,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:01,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119017473] [2023-02-15 10:14:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:01,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:03,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:03,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119017473] [2023-02-15 10:14:03,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119017473] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:14:03,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058348533] [2023-02-15 10:14:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:03,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:03,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:03,464 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) [2023-02-15 10:14:03,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:14:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:03,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-15 10:14:03,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:14:03,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:03,661 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:14:03,665 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 24 [2023-02-15 10:14:03,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:14:03,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:14:03,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:03,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 10:14:04,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:04,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2023-02-15 10:14:04,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:04,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2023-02-15 10:14:04,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:04,577 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:14:04,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 38 [2023-02-15 10:14:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:04,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:14:05,015 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:05,016 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:05,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:05,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058348533] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:14:05,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:14:05,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2023-02-15 10:14:05,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196563249] [2023-02-15 10:14:05,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:14:05,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 10:14:05,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:05,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 10:14:05,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 10:14:05,034 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 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) [2023-02-15 10:14:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:06,512 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2023-02-15 10:14:06,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 10:14:06,513 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-15 10:14:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:06,514 INFO L225 Difference]: With dead ends: 79 [2023-02-15 10:14:06,514 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 10:14:06,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=504, Invalid=2802, Unknown=0, NotChecked=0, Total=3306 [2023-02-15 10:14:06,516 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 162 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:14:06,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 158 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 10:14:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 10:14:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 46. [2023-02-15 10:14:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2023-02-15 10:14:06,526 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 24 [2023-02-15 10:14:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:06,527 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2023-02-15 10:14:06,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 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) [2023-02-15 10:14:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2023-02-15 10:14:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 10:14:06,528 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:06,528 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:06,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:14:06,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:06,740 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:06,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:06,740 INFO L85 PathProgramCache]: Analyzing trace with hash 924425184, now seen corresponding path program 2 times [2023-02-15 10:14:06,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:06,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609544142] [2023-02-15 10:14:06,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:14:06,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:06,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609544142] [2023-02-15 10:14:06,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609544142] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:14:06,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655182653] [2023-02-15 10:14:06,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:14:06,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:06,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:06,814 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) [2023-02-15 10:14:06,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:14:06,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:14:06,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:14:06,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:14:06,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:14:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:14:06,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:14:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:14:06,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655182653] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:14:06,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:14:06,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-02-15 10:14:06,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948101145] [2023-02-15 10:14:06,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:14:06,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:14:06,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:14:06,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:14:06,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:14:06,984 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:14:07,230 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2023-02-15 10:14:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 10:14:07,230 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 10:14:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:14:07,231 INFO L225 Difference]: With dead ends: 99 [2023-02-15 10:14:07,231 INFO L226 Difference]: Without dead ends: 51 [2023-02-15 10:14:07,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2023-02-15 10:14:07,232 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 116 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:14:07,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 95 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:14:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-15 10:14:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2023-02-15 10:14:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-15 10:14:07,243 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2023-02-15 10:14:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:14:07,243 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-15 10:14:07,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:14:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-15 10:14:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 10:14:07,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:14:07,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:14:07,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:14:07,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-15 10:14:07,445 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:14:07,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:14:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 3 times [2023-02-15 10:14:07,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:14:07,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353381724] [2023-02-15 10:14:07,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:14:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:14:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:14:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:09,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:14:09,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353381724] [2023-02-15 10:14:09,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353381724] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:14:09,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518374499] [2023-02-15 10:14:09,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:14:09,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:14:09,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:14:09,685 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) [2023-02-15 10:14:09,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:14:09,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:14:09,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:14:09,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-15 10:14:09,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:14:09,844 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:14:09,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:09,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-15 10:14:09,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:09,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:14:10,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:10,045 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-02-15 10:14:10,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 10:14:10,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:10,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:10,366 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 10:14:10,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2023-02-15 10:14:10,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:10,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:10,512 INFO L321 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2023-02-15 10:14:10,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 62 [2023-02-15 10:14:10,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:10,893 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:10,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:10,897 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 10:14:10,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 55 [2023-02-15 10:14:11,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,090 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:14:11,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2023-02-15 10:14:11,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 49 [2023-02-15 10:14:11,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,518 INFO L321 Elim1Store]: treesize reduction 34, result has 49.3 percent of original size [2023-02-15 10:14:11,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 74 [2023-02-15 10:14:11,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:14:11,964 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:14:11,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2023-02-15 10:14:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:14:11,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:15:52,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,558 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,559 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:15:52,565 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,565 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,566 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,566 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,567 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:15:52,571 INFO L321 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-02-15 10:15:52,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 167 treesize of output 1 [2023-02-15 10:15:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:15:52,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518374499] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:15:52,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:15:52,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 24] total 67 [2023-02-15 10:15:52,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240622360] [2023-02-15 10:15:52,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:15:52,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-02-15 10:15:52,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:15:52,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-02-15 10:15:52,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=3884, Unknown=46, NotChecked=0, Total=4422 [2023-02-15 10:15:52,577 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 67 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:15:54,622 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse31 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse9 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (+ c_~N~0 1))) (and (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 8)) 1)))) (store .cse6 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (< (+ |v_ULTIMATE.start_main_~i~0#1_64| 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_64| .cse9)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (= (select (store (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse16 |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181)))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13))))) (store (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse11 .cse12 .cse13))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (<= (mod c_~N~0 4294967296) 536870911) (or (< .cse9 c_~N~0) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (= .cse8 (select (store (let ((.cse21 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))))) (store (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse18 .cse19 (select (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse20))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse28 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 8)) 1)))) (store .cse30 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse24 (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27))))) (store (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse25 .cse26 (select (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse27))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_64| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_64| .cse9)))) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse16 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181)))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse34 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse32 (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))))) (store (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse33 .cse34 .cse35))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse16 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181)))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse41 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse38 (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41))))) (store (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse39 .cse40 (select (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse41))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))))) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47))))) (store (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse45 (select (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse46 .cse47)))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0))))))) is different from false [2023-02-15 10:15:56,632 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store .cse31 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (.cse9 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse8 (+ c_~N~0 1))) (and (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (|v_ULTIMATE.start_main_~i~0#1_64| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 8)) 1)))) (store .cse6 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))))) (store (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse1 .cse2 (select (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse3))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (< (+ |v_ULTIMATE.start_main_~i~0#1_64| 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_64| .cse9)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (= (select (store (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse16 |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181)))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse10 (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13))))) (store (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse11 .cse12 .cse13))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (<= (mod c_~N~0 4294967296) 536870911) (or (< .cse9 c_~N~0) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (= .cse8 (select (store (let ((.cse21 (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (store .cse23 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse17 (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))))) (store (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse18 .cse19 (select (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse20))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_64| Int)) (or (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse28 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse31 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_64| 8)) 1)))) (store .cse30 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse27 (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse24 (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse27))))) (store (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse25 .cse26 (select (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse27))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_64| 1) c_~N~0) (not (<= |v_ULTIMATE.start_main_~i~0#1_64| .cse9)))) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int) (|v_ULTIMATE.start_main_~i~0#1_61| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse16 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (+ (* |v_ULTIMATE.start_main_~i~0#1_61| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181)))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse35 (select (select .cse36 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse34 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse32 (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))))) (store (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select .cse32 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse33 .cse34 .cse35))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (< (+ |v_ULTIMATE.start_main_~i~0#1_61| 1) c_~N~0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int) (v_ArrVal_181 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse16 (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_181)))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select (select .cse42 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse41 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse38 (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40 .cse41))))) (store (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse39 .cse40 (select (select .cse38 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse41))))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0)))))) (forall ((v_ArrVal_188 Int) (|v_ULTIMATE.start_main_~i~0#1_57| Int) (|v_ULTIMATE.start_main_~i~0#1_54| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_54| 1) c_~N~0) (= (select (store (let ((.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse45 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_57| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47))))) (store (select .cse44 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse45 (select (select .cse44 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse46 .cse47)))))) (+ (* |v_ULTIMATE.start_main_~i~0#1_54| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse8) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_57|)) (not (< |v_ULTIMATE.start_main_~i~0#1_57| c_~N~0))))))) is different from true [2023-02-15 10:16:18,888 WARN L233 SmtUtils]: Spent 20.28s on a formula simplification. DAG size of input: 98 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:16:48,830 WARN L233 SmtUtils]: Spent 29.55s on a formula simplification. DAG size of input: 128 DAG size of output: 122 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:16:50,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:52,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:55,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:16:59,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:17:01,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:17:03,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:17:08,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:17:10,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:17:12,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:17:15,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:17:48,805 WARN L233 SmtUtils]: Spent 30.06s on a formula simplification. DAG size of input: 131 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:18:21,751 WARN L233 SmtUtils]: Spent 30.46s on a formula simplification. DAG size of input: 134 DAG size of output: 129 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:18:24,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:18:26,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]