./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/sina4.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 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:19:26,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:19:26,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:19:26,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:19:26,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:19:26,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:19:26,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:19:26,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:19:26,868 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:19:26,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:19:26,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:19:26,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:19:26,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:19:26,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:19:26,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:19:26,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:19:26,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:19:26,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:19:26,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:19:26,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:19:26,881 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:19:26,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:19:26,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:19:26,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:19:26,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:19:26,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:19:26,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:19:26,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:19:26,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:19:26,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:19:26,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:19:26,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:19:26,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:19:26,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:19:26,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:19:26,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:19:26,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:19:26,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:19:26,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:19:26,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:19:26,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:19:26,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:19:26,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:19:26,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:19:26,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:19:26,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:19:26,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:19:26,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:19:26,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:19:26,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:19:26,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:19:26,941 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:19:26,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:19:26,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:19:26,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:19:26,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:19:26,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:19:26,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:19:26,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:19:26,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:19:26,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:19:26,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:19:26,946 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:19:26,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:19:26,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:19:26,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:19:26,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:19:26,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:19:26,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:19:26,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:19:26,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:19:26,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:19:26,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:19:26,949 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:19:26,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:19:26,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:19:26,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.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 -> 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 [2022-07-20 22:19:27,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:19:27,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:19:27,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:19:27,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:19:27,186 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:19:27,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina4.c [2022-07-20 22:19:27,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6288ea0f/eb7f4d2cbb654a1d8e567d160396ef6a/FLAGd418fd493 [2022-07-20 22:19:27,608 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:19:27,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c [2022-07-20 22:19:27,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6288ea0f/eb7f4d2cbb654a1d8e567d160396ef6a/FLAGd418fd493 [2022-07-20 22:19:27,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6288ea0f/eb7f4d2cbb654a1d8e567d160396ef6a [2022-07-20 22:19:27,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:19:27,630 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:19:27,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:19:27,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:19:27,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:19:27,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464eab5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27, skipping insertion in model container [2022-07-20 22:19:27,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:19:27,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:19:27,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c[588,601] [2022-07-20 22:19:27,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:19:27,861 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:19:27,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c[588,601] [2022-07-20 22:19:27,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:19:27,892 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:19:27,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27 WrapperNode [2022-07-20 22:19:27,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:19:27,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:19:27,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:19:27,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:19:27,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,931 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-07-20 22:19:27,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:19:27,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:19:27,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:19:27,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:19:27,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:19:27,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:19:27,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:19:27,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:19:27,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (1/1) ... [2022-07-20 22:19:27,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:19:27,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:19:27,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 22:19:27,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 22:19:28,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:19:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:19:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 22:19:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 22:19:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:19:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:19:28,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:19:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 22:19:28,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 22:19:28,054 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:19:28,055 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:19:28,172 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:19:28,177 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:19:28,177 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-20 22:19:28,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:19:28 BoogieIcfgContainer [2022-07-20 22:19:28,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:19:28,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:19:28,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:19:28,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:19:28,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:19:27" (1/3) ... [2022-07-20 22:19:28,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4821ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:19:28, skipping insertion in model container [2022-07-20 22:19:28,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:19:27" (2/3) ... [2022-07-20 22:19:28,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4821ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:19:28, skipping insertion in model container [2022-07-20 22:19:28,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:19:28" (3/3) ... [2022-07-20 22:19:28,186 INFO L111 eAbstractionObserver]: Analyzing ICFG sina4.c [2022-07-20 22:19:28,198 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:19:28,199 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:19:28,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:19:28,274 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39fce302, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13f8f2fb [2022-07-20 22:19:28,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:19:28,278 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) [2022-07-20 22:19:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 22:19:28,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:19:28,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:19:28,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:19:28,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:19:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-07-20 22:19:28,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:19:28,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094781937] [2022-07-20 22:19:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:19:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:19:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:19:28,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:19:28,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094781937] [2022-07-20 22:19:28,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094781937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:19:28,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:19:28,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 22:19:28,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671730630] [2022-07-20 22:19:28,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:19:28,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 22:19:28,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:19:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 22:19:28,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 22:19:28,505 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) [2022-07-20 22:19:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:19:28,537 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-07-20 22:19:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 22:19:28,540 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 [2022-07-20 22:19:28,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:19:28,549 INFO L225 Difference]: With dead ends: 50 [2022-07-20 22:19:28,549 INFO L226 Difference]: Without dead ends: 23 [2022-07-20 22:19:28,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 22:19:28,567 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 [2022-07-20 22:19:28,569 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] [2022-07-20 22:19:28,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-20 22:19:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-20 22:19:28,598 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) [2022-07-20 22:19:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-20 22:19:28,601 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-07-20 22:19:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:19:28,602 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-20 22:19:28,603 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) [2022-07-20 22:19:28,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-20 22:19:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 22:19:28,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:19:28,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:19:28,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:19:28,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:19:28,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:19:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-07-20 22:19:28,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:19:28,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363461746] [2022-07-20 22:19:28,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:19:28,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:19:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:19:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:19:28,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363461746] [2022-07-20 22:19:28,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363461746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:19:28,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:19:28,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:19:28,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148847612] [2022-07-20 22:19:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:19:28,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:19:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:19:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:19:28,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:19:28,728 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) [2022-07-20 22:19:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:19:28,784 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-07-20 22:19:28,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:19:28,785 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 [2022-07-20 22:19:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:19:28,785 INFO L225 Difference]: With dead ends: 53 [2022-07-20 22:19:28,786 INFO L226 Difference]: Without dead ends: 37 [2022-07-20 22:19:28,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:19:28,787 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:19:28,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:19:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-20 22:19:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-07-20 22:19:28,793 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) [2022-07-20 22:19:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-20 22:19:28,794 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-07-20 22:19:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:19:28,795 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-20 22:19:28,795 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) [2022-07-20 22:19:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-20 22:19:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 22:19:28,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:19:28,796 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] [2022-07-20 22:19:28,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:19:28,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:19:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:19:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-07-20 22:19:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:19:28,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511895318] [2022-07-20 22:19:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:19:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:19:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:19:29,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:19:29,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511895318] [2022-07-20 22:19:29,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511895318] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:19:29,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493103843] [2022-07-20 22:19:29,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:19:29,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:19:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:19:29,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:19:29,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 22:19:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:29,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-20 22:19:29,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:19:29,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:19:29,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:19:29,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:19:29,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-20 22:19:30,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-07-20 22:19:30,243 INFO L356 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2022-07-20 22:19:30,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2022-07-20 22:19:30,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:19:30,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 62 [2022-07-20 22:19:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:19:30,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:19:32,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int)) (= (select (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) is different from false [2022-07-20 22:19:33,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:19:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 22:19:33,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493103843] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:19:33,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:19:33,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-07-20 22:19:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142666756] [2022-07-20 22:19:33,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:19:33,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 22:19:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:19:33,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 22:19:33,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=916, Unknown=1, NotChecked=62, Total=1122 [2022-07-20 22:19:33,135 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:19:41,489 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 43 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 22:19:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:19:41,543 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-20 22:19:41,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 22:19:41,544 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 22:19:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:19:41,545 INFO L225 Difference]: With dead ends: 53 [2022-07-20 22:19:41,545 INFO L226 Difference]: Without dead ends: 51 [2022-07-20 22:19:41,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=178, Invalid=1085, Unknown=1, NotChecked=68, Total=1332 [2022-07-20 22:19:41,546 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:19:41,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 130 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 276 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2022-07-20 22:19:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-20 22:19:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2022-07-20 22:19:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:19:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-07-20 22:19:41,560 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2022-07-20 22:19:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:19:41,561 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-07-20 22:19:41,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:19:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-07-20 22:19:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 22:19:41,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:19:41,566 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] [2022-07-20 22:19:41,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 22:19:41,789 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 [2022-07-20 22:19:41,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:19:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:19:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-07-20 22:19:41,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:19:41,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896059586] [2022-07-20 22:19:41,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:19:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:19:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:19:41,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:19:41,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896059586] [2022-07-20 22:19:41,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896059586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:19:41,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101744792] [2022-07-20 22:19:41,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:19:41,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:19:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:19:41,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:19:41,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 22:19:41,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:19:41,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:19:41,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:19:41,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:19:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:19:42,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:19:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:19:42,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101744792] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:19:42,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:19:42,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 22:19:42,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202185273] [2022-07-20 22:19:42,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:19:42,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:19:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:19:42,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:19:42,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:19:42,068 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:19:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:19:42,214 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-07-20 22:19:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:19:42,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 22:19:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:19:42,216 INFO L225 Difference]: With dead ends: 101 [2022-07-20 22:19:42,216 INFO L226 Difference]: Without dead ends: 66 [2022-07-20 22:19:42,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-20 22:19:42,217 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:19:42,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 56 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:19:42,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-20 22:19:42,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-07-20 22:19:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:19:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-07-20 22:19:42,224 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2022-07-20 22:19:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:19:42,224 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-07-20 22:19:42,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:19:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-07-20 22:19:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 22:19:42,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:19:42,226 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] [2022-07-20 22:19:42,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 22:19:42,438 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 [2022-07-20 22:19:42,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:19:42,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:19:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2022-07-20 22:19:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:19:42,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466018774] [2022-07-20 22:19:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:19:42,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:19:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:19:42,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:19:42,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466018774] [2022-07-20 22:19:42,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466018774] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:19:42,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159217131] [2022-07-20 22:19:42,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:19:42,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:19:42,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:19:42,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:19:42,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 22:19:42,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 22:19:42,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:19:42,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:19:42,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:19:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:19:42,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:19:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:19:42,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159217131] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:19:42,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:19:42,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 22:19:42,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5755405] [2022-07-20 22:19:42,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:19:42,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:19:42,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:19:42,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:19:42,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:19:42,681 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:19:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:19:42,802 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-20 22:19:42,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:19:42,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 22:19:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:19:42,804 INFO L225 Difference]: With dead ends: 63 [2022-07-20 22:19:42,804 INFO L226 Difference]: Without dead ends: 50 [2022-07-20 22:19:42,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-20 22:19:42,805 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 91 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:19:42,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 42 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:19:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-20 22:19:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-07-20 22:19:42,809 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) [2022-07-20 22:19:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-20 22:19:42,810 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-07-20 22:19:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:19:42,810 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-20 22:19:42,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:19:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-20 22:19:42,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 22:19:42,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:19:42,811 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] [2022-07-20 22:19:42,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 22:19:43,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:19:43,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:19:43,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:19:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-07-20 22:19:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:19:43,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514532603] [2022-07-20 22:19:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:19:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:19:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:19:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:19:44,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:19:44,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514532603] [2022-07-20 22:19:44,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514532603] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:19:44,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340581519] [2022-07-20 22:19:44,268 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:19:44,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:19:44,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:19:44,273 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:19:44,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 22:19:44,333 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:19:44,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:19:44,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-20 22:19:44,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:19:44,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:19:44,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:44,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:19:44,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:44,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:44,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 22:19:44,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:44,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:19:44,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:44,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-20 22:19:44,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:44,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:44,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2022-07-20 22:19:45,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:45,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:19:45,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:45,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2022-07-20 22:19:45,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:45,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:45,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:45,303 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-20 22:19:45,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2022-07-20 22:19:45,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:45,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:19:45,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:19:45,514 INFO L356 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2022-07-20 22:19:45,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2022-07-20 22:19:45,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:45,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:45,882 INFO L356 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-07-20 22:19:45,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 62 [2022-07-20 22:19:46,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:19:46,384 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:19:46,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 58 [2022-07-20 22:19:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:19:46,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:19:48,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) is different from false [2022-07-20 22:20:04,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 8)) v_ArrVal_223))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) is different from false [2022-07-20 22:20:05,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_72| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 8)) v_ArrVal_223))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) is different from false [2022-07-20 22:20:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 22:20:07,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340581519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:20:07,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:20:07,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 21, 22] total 64 [2022-07-20 22:20:07,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584546496] [2022-07-20 22:20:07,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:20:07,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-20 22:20:07,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:20:07,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-20 22:20:07,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=3363, Unknown=4, NotChecked=360, Total=4032 [2022-07-20 22:20:07,224 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:09,534 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= c_~N~0 2) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 8)) v_ArrVal_223))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_69|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) (or (< 2 c_~N~0) (let ((.cse3 (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse2 (+ c_~N~0 1))) (and (<= .cse2 .cse3) (<= .cse3 .cse2)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select .cse5 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (and (= (+ (* .cse4 2) (* (- 1) (select .cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (* (- 1) .cse6)) 0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (* (- 1) .cse4) .cse6) 1))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (< 1 c_~N~0) (<= 2 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) is different from false [2022-07-20 22:20:11,643 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse0 (+ c_~N~0 2))) (and (<= c_~N~0 2) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse0 .cse1) (< 1 c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (and (or (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (and (= |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)) (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~#sum~0#1.base|))) (< (+ |ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (or (= (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse2) 3) (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 4) (<= .cse1 .cse0))) is different from false [2022-07-20 22:20:13,805 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse0 (+ c_~N~0 2))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_69| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_69|)))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse0 .cse1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse1 .cse0))) is different from false [2022-07-20 22:20:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:20:13,836 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-07-20 22:20:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-20 22:20:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-20 22:20:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:20:13,839 INFO L225 Difference]: With dead ends: 81 [2022-07-20 22:20:13,841 INFO L226 Difference]: Without dead ends: 79 [2022-07-20 22:20:13,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=360, Invalid=3947, Unknown=7, NotChecked=798, Total=5112 [2022-07-20 22:20:13,844 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 481 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:20:13,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 183 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 252 Invalid, 0 Unknown, 481 Unchecked, 0.2s Time] [2022-07-20 22:20:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-20 22:20:13,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 52. [2022-07-20 22:20:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-20 22:20:13,859 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 32 [2022-07-20 22:20:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:20:13,860 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-20 22:20:13,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-20 22:20:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:20:13,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:20:13,865 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:20:13,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 22:20:14,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:14,079 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:20:14,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:20:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2147373800, now seen corresponding path program 5 times [2022-07-20 22:20:14,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:20:14,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839938096] [2022-07-20 22:20:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:20:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:20:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 22:20:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:20:14,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839938096] [2022-07-20 22:20:14,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839938096] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:20:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3297530] [2022-07-20 22:20:14,168 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 22:20:14,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:14,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:20:14,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:20:14,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 22:20:14,285 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-20 22:20:14,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:20:14,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:20:14,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:20:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 22:20:14,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:20:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 22:20:14,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3297530] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:20:14,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:20:14,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 22:20:14,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682233881] [2022-07-20 22:20:14,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:20:14,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 22:20:14,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:20:14,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 22:20:14,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:20:14,391 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:20:14,557 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-07-20 22:20:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:20:14,558 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 22:20:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:20:14,559 INFO L225 Difference]: With dead ends: 129 [2022-07-20 22:20:14,559 INFO L226 Difference]: Without dead ends: 105 [2022-07-20 22:20:14,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:20:14,560 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 114 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:20:14,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 66 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:20:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-20 22:20:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2022-07-20 22:20:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.131578947368421) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-07-20 22:20:14,572 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 34 [2022-07-20 22:20:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:20:14,573 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-07-20 22:20:14,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-07-20 22:20:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 22:20:14,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:20:14,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:20:14,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 22:20:14,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:14,788 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:20:14,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:20:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-07-20 22:20:14,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:20:14,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964551131] [2022-07-20 22:20:14,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:20:14,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:20:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:20:16,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:20:16,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964551131] [2022-07-20 22:20:16,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964551131] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:20:16,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931550421] [2022-07-20 22:20:16,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:20:16,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:16,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:20:16,157 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:20:16,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 22:20:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:16,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-20 22:20:16,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:20:16,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:20:16,245 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 22:20:16,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2022-07-20 22:20:16,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:20:16,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:16,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 22:20:16,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:16,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:16,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:16,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-07-20 22:20:16,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:16,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:16,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:16,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2022-07-20 22:20:16,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:16,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:16,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2022-07-20 22:20:16,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:16,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:16,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:16,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-07-20 22:20:17,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:17,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:17,181 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-20 22:20:17,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 67 [2022-07-20 22:20:17,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:17,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:17,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:17,360 INFO L356 Elim1Store]: treesize reduction 51, result has 27.1 percent of original size [2022-07-20 22:20:17,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 45 treesize of output 53 [2022-07-20 22:20:17,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:17,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:17,831 INFO L356 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2022-07-20 22:20:17,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 38 [2022-07-20 22:20:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:20:17,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:20:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:20:21,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931550421] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:20:21,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:20:21,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 23] total 66 [2022-07-20 22:20:21,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419796813] [2022-07-20 22:20:21,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:20:21,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-20 22:20:21,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:20:21,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-20 22:20:21,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=3975, Unknown=0, NotChecked=0, Total=4290 [2022-07-20 22:20:21,196 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:20:28,033 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-20 22:20:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-20 22:20:28,033 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 22:20:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:20:28,034 INFO L225 Difference]: With dead ends: 126 [2022-07-20 22:20:28,034 INFO L226 Difference]: Without dead ends: 81 [2022-07-20 22:20:28,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2292 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=692, Invalid=7680, Unknown=0, NotChecked=0, Total=8372 [2022-07-20 22:20:28,036 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:20:28,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 257 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 341 Invalid, 0 Unknown, 164 Unchecked, 0.7s Time] [2022-07-20 22:20:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-20 22:20:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-20 22:20:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2022-07-20 22:20:28,047 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 36 [2022-07-20 22:20:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:20:28,047 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2022-07-20 22:20:28,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2022-07-20 22:20:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 22:20:28,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:20:28,048 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:20:28,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 22:20:28,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:28,263 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:20:28,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:20:28,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1245131882, now seen corresponding path program 6 times [2022-07-20 22:20:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:20:28,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356341001] [2022-07-20 22:20:28,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:20:28,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:20:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 22:20:28,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:20:28,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356341001] [2022-07-20 22:20:28,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356341001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:20:28,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579356243] [2022-07-20 22:20:28,334 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 22:20:28,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:28,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:20:28,336 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:20:28,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 22:20:28,420 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-20 22:20:28,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:20:28,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:20:28,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:20:28,477 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 22:20:28,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:20:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 22:20:28,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579356243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:20:28,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:20:28,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 22:20:28,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940415773] [2022-07-20 22:20:28,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:20:28,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 22:20:28,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:20:28,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 22:20:28,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:20:28,514 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:20:28,668 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-07-20 22:20:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 22:20:28,668 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 22:20:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:20:28,668 INFO L225 Difference]: With dead ends: 104 [2022-07-20 22:20:28,669 INFO L226 Difference]: Without dead ends: 74 [2022-07-20 22:20:28,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-20 22:20:28,670 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 131 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:20:28,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 70 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:20:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-20 22:20:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 43. [2022-07-20 22:20:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:28,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-07-20 22:20:28,676 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2022-07-20 22:20:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:20:28,676 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-07-20 22:20:28,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-07-20 22:20:28,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 22:20:28,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:20:28,677 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:20:28,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 22:20:28,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:28,888 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:20:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:20:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2022-07-20 22:20:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:20:28,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822165029] [2022-07-20 22:20:28,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:20:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:20:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:20:30,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:20:30,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822165029] [2022-07-20 22:20:30,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822165029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:20:30,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495571448] [2022-07-20 22:20:30,175 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 22:20:30,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:30,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:20:30,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:20:30,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 22:20:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:30,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-20 22:20:30,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:20:30,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:20:30,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 22:20:30,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:20:30,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 22:20:30,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-20 22:20:30,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2022-07-20 22:20:30,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:30,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2022-07-20 22:20:30,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2022-07-20 22:20:30,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:30,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:30,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 55 [2022-07-20 22:20:31,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:31,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:31,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:31,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:31,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:31,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:31,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2022-07-20 22:20:31,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:31,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:31,156 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-20 22:20:31,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 56 [2022-07-20 22:20:31,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:31,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:31,314 INFO L356 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2022-07-20 22:20:31,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2022-07-20 22:20:31,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:31,581 INFO L356 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-07-20 22:20:31,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 62 [2022-07-20 22:20:31,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:31,884 INFO L356 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-07-20 22:20:31,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 62 [2022-07-20 22:20:32,315 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:20:32,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 58 [2022-07-20 22:20:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:20:32,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:20:34,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (forall ((v_ArrVal_519 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|))))) is different from false [2022-07-20 22:20:34,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_149|)))) is different from false [2022-07-20 22:20:36,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) is different from false [2022-07-20 22:20:38,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)))) is different from false [2022-07-20 22:20:41,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) is different from false [2022-07-20 22:22:04,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:04,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:04,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:04,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:04,202 INFO L356 Elim1Store]: treesize reduction 95, result has 1.0 percent of original size [2022-07-20 22:22:04,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 1 [2022-07-20 22:22:04,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:04,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:04,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:04,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:04,215 INFO L356 Elim1Store]: treesize reduction 95, result has 1.0 percent of original size [2022-07-20 22:22:04,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 257 treesize of output 1 [2022-07-20 22:22:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 1 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-20 22:22:04,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495571448] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:22:04,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:22:04,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 30] total 73 [2022-07-20 22:22:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126682056] [2022-07-20 22:22:04,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:22:04,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-20 22:22:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:22:04,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-20 22:22:04,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=4219, Unknown=42, NotChecked=680, Total=5256 [2022-07-20 22:22:04,221 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 73 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:22:06,607 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~N~0 1)) (.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0))) (and (= (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 8) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (+ (- 2) .cse3)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse2) (= .cse2 1) (= (+ .cse3 1) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= .cse4 .cse5) (<= 3 c_~N~0) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse5 .cse4) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-07-20 22:22:08,685 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 3 c_~N~0) (forall ((v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_510) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_153|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (= 4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-07-20 22:22:14,578 WARN L233 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 79 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 22:22:16,582 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_153| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (+ c_~N~0 2) (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_153|)))) (forall ((v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_153| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_510) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_153|)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_153|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_150|))))) is different from false [2022-07-20 22:22:21,574 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~b~0#1.offset|))) (.cse2 (+ c_~N~0 2))) (and (= 5 .cse0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (and (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (or (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (and (= |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)) (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~#sum~0#1.base|))) (or (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 3 c_~N~0) (<= .cse2 .cse0) (<= c_~N~0 3) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse0 .cse2) (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_150|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (= (+ c_~N~0 2) (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_150|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_516) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) is different from false [2022-07-20 22:22:25,689 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse1 (+ c_~N~0 2)) (.cse0 (select .cse2 0))) (and (<= .cse0 .cse1) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= 3 c_~N~0) (<= (+ 1 (div (* (- 1) |c_ULTIMATE.start_main_~b~0#1.offset|) 8)) |c_ULTIMATE.start_main_~i~0#1|) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 3) (= 5 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~a~0#1.base| Int)) (and (or (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (or (= (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 4) (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_main_~i~0#1_149| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_149|)) (forall ((v_ArrVal_519 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_149|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) is different from false [2022-07-20 22:22:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:22:28,457 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-07-20 22:22:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-20 22:22:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 0 states have call successors, (0), 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 40 [2022-07-20 22:22:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:22:28,458 INFO L225 Difference]: With dead ends: 90 [2022-07-20 22:22:28,458 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 22:22:28,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 32 SyntacticMatches, 9 SemanticMatches, 85 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 116.0s TimeCoverageRelationStatistics Valid=425, Invalid=5417, Unknown=50, NotChecked=1590, Total=7482 [2022-07-20 22:22:28,461 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 445 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:22:28,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 177 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 274 Invalid, 0 Unknown, 445 Unchecked, 0.1s Time] [2022-07-20 22:22:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 22:22:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2022-07-20 22:22:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 81 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:22:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2022-07-20 22:22:28,472 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 40 [2022-07-20 22:22:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:22:28,472 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2022-07-20 22:22:28,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:22:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2022-07-20 22:22:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 22:22:28,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:22:28,474 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:22:28,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 22:22:28,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-20 22:22:28,676 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:22:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:22:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1012369648, now seen corresponding path program 8 times [2022-07-20 22:22:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:22:28,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902097947] [2022-07-20 22:22:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:22:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:22:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:22:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 22:22:28,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:22:28,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902097947] [2022-07-20 22:22:28,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902097947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:22:28,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338559005] [2022-07-20 22:22:28,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:22:28,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:22:28,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:22:28,772 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:22:28,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 22:22:28,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:22:28,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:22:28,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:22:28,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:22:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 22:22:28,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:22:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 22:22:28,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338559005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:22:28,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:22:28,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-20 22:22:28,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694994781] [2022-07-20 22:22:28,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:22:28,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:22:28,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:22:28,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:22:28,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:22:28,954 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 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) [2022-07-20 22:22:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:22:29,163 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2022-07-20 22:22:29,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 22:22:29,163 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 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 42 [2022-07-20 22:22:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:22:29,164 INFO L225 Difference]: With dead ends: 184 [2022-07-20 22:22:29,164 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 22:22:29,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-20 22:22:29,166 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 197 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:22:29,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 89 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 22:22:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 22:22:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-07-20 22:22:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1057692307692308) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:22:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2022-07-20 22:22:29,179 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 42 [2022-07-20 22:22:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:22:29,179 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2022-07-20 22:22:29,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 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) [2022-07-20 22:22:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2022-07-20 22:22:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 22:22:29,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:22:29,181 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:22:29,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 22:22:29,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:22:29,397 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:22:29,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:22:29,397 INFO L85 PathProgramCache]: Analyzing trace with hash -308361392, now seen corresponding path program 9 times [2022-07-20 22:22:29,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:22:29,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462910755] [2022-07-20 22:22:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:22:29,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:22:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:22:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 22:22:29,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:22:29,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462910755] [2022-07-20 22:22:29,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462910755] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:22:29,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312817050] [2022-07-20 22:22:29,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:22:29,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:22:29,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:22:29,478 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:22:29,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 22:22:29,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-20 22:22:29,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:22:29,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:22:29,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:22:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 22:22:29,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:22:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 22:22:29,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312817050] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:22:29,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:22:29,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-20 22:22:29,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728825301] [2022-07-20 22:22:29,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:22:29,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:22:29,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:22:29,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:22:29,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:22:29,801 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 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) [2022-07-20 22:22:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:22:30,063 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-07-20 22:22:30,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 22:22:30,064 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 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 42 [2022-07-20 22:22:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:22:30,064 INFO L225 Difference]: With dead ends: 146 [2022-07-20 22:22:30,065 INFO L226 Difference]: Without dead ends: 117 [2022-07-20 22:22:30,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-20 22:22:30,066 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 202 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:22:30,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 133 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 22:22:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-20 22:22:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2022-07-20 22:22:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:22:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-07-20 22:22:30,077 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 42 [2022-07-20 22:22:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:22:30,078 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-07-20 22:22:30,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 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) [2022-07-20 22:22:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-07-20 22:22:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 22:22:30,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:22:30,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:22:30,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 22:22:30,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-20 22:22:30,292 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:22:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:22:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2112995272, now seen corresponding path program 2 times [2022-07-20 22:22:30,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:22:30,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83447509] [2022-07-20 22:22:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:22:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:22:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:22:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:22:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:22:31,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83447509] [2022-07-20 22:22:31,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83447509] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:22:31,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084707666] [2022-07-20 22:22:31,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:22:31,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:22:31,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:22:31,832 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:22:31,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 22:22:31,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:22:31,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:22:31,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-20 22:22:31,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:22:31,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 22:22:31,949 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 22:22:31,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 102 [2022-07-20 22:22:32,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:22:32,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-20 22:22:32,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-07-20 22:22:32,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,442 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:32,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-20 22:22:32,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:32,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 51 [2022-07-20 22:22:32,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2022-07-20 22:22:32,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:32,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 53 [2022-07-20 22:22:32,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:32,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:32,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2022-07-20 22:22:33,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:33,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:22:33,100 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-20 22:22:33,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 52 [2022-07-20 22:22:33,245 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 22:22:33,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-07-20 22:22:33,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:33,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-20 22:22:33,476 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 22:22:33,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2022-07-20 22:22:33,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 31 [2022-07-20 22:22:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:22:33,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:22:36,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_225|)) (forall ((v_ArrVal_766 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_225|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_766) (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) is different from false [2022-07-20 22:22:51,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_766 Int)) (or (= (+ c_~N~0 2) (select (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| .cse0 8) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:51,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_225|)) (= (+ c_~N~0 2) (select (store (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store v_ArrVal_762 (+ |ULTIMATE.start_main_~b~0#1.offset| .cse0 8) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))))) is different from false [2022-07-20 22:22:51,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:51,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)) (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))))) is different from false [2022-07-20 22:22:51,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)))) is different from false [2022-07-20 22:22:52,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:52,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse1 .cse2)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_229|)))) is different from false [2022-07-20 22:22:52,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (+ .cse4 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (store .cse3 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_757))) (store .cse1 .cse2 (+ (select .cse3 .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_229|)))) is different from false [2022-07-20 22:22:52,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse1 .cse2 (+ (select .cse3 .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)) (+ c_~N~0 2)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:52,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:52,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:52,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse8 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse6 .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:52,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse8 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse6 .cse7)))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:52,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ .cse6 .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse8))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)) (+ c_~N~0 2)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:52,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (= (+ c_~N~0 2) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse6 .cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse8)))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:52,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (let ((.cse2 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse2 (+ (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse3 (let ((.cse12 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12))) (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse9 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse10 .cse11)))))))))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse4 .cse5 (+ (select .cse6 .cse5) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse2)))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:52,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (and (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (let ((.cse10 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse7 .cse8 .cse9)))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)))) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (let ((.cse11 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse11 (+ (let ((.cse14 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse12 (let ((.cse21 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21))) (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse18 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (+ (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse18 .cse19 .cse20)))))))))) (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse15 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse13 .cse14 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse15 .cse14))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse11)) (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:52,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (and (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (let ((.cse10 (let ((.cse11 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse11 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse7 .cse8 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse9)))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)) (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 4) (let ((.cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse12 (+ (let ((.cse15 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse13 (let ((.cse22 (let ((.cse23 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse23 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))) (+ .cse19 .cse20 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse21)))))))))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse16 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse14 .cse15 (+ (select .cse16 .cse15) (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse12))))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:53,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (and (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ 5 |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (let ((.cse10 (let ((.cse11 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse11 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse8 .cse9)))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)))) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (let ((.cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse12 (+ (let ((.cse15 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse13 (let ((.cse22 (let ((.cse23 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse23 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse23 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse21 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse20 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))) (+ .cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse20 .cse21)))))))))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse16 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse14 .cse15 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse16 .cse15))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse12)) (+ 5 |c_ULTIMATE.start_main_~i~0#1|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:53,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int) (|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (and (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (+ 5 |c_ULTIMATE.start_main_~i~0#1|) (let ((.cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse0 (+ (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse1 (let ((.cse10 (let ((.cse11 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse11 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse11 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10))) (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (+ .cse7 .cse8 .cse9 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse2 .cse3 (+ (select .cse4 .cse3) (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse0)))) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_760 Int) (v_ArrVal_757 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (<= (let ((.cse12 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse12 (+ (let ((.cse15 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (let ((.cse13 (let ((.cse22 (let ((.cse23 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse23 8 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ .cse23 16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))) (+ .cse19 .cse20 .cse21 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))))))))))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse16 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_757))) (store .cse14 .cse15 (+ (select .cse16 .cse15) (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse12)) (+ 5 |c_ULTIMATE.start_main_~i~0#1|)))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_229|)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) is different from false [2022-07-20 22:22:53,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:53,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:53,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:53,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:53,398 INFO L356 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2022-07-20 22:22:53,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 1 [2022-07-20 22:22:53,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:53,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:53,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:53,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:22:53,413 INFO L356 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2022-07-20 22:22:53,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 180 treesize of output 1 [2022-07-20 22:22:53,415 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-07-20 22:22:53,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084707666] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:22:53,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:22:53,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 31] total 89 [2022-07-20 22:22:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42225048] [2022-07-20 22:22:53,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:22:53,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-07-20 22:22:53,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:22:53,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-07-20 22:22:53,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=4200, Unknown=38, NotChecked=3192, Total=7832 [2022-07-20 22:22:53,419 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 89 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:23:01,264 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 93 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 22:23:03,268 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select .cse2 .cse3)) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (and (= .cse0 4) (< 2 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_229| Int)) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_225| Int) (v_ArrVal_760 Int) (v_ArrVal_762 (Array Int Int)) (v_ArrVal_766 Int)) (or (= (+ c_~N~0 2) (let ((.cse1 (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (store (store v_ArrVal_762 .cse1 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_229|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_760)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_225|)) v_ArrVal_766) .cse1))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_225|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_229|)))) (<= 3 c_~N~0) (= (select .cse2 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (or (not (= .cse3 8)) (let ((.cse4 (+ c_~N~0 1))) (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= .cse4 .cse0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse5 (<= .cse0 .cse4)))) (<= c_~N~0 3) .cse5 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-07-20 22:23:07,507 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse3 (+ .cse7 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse2 (select .cse0 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse1 (+ c_~N~0 1)) (.cse4 (+ c_~N~0 2)) (.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse3))) (and (< 2 c_~N~0) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (<= .cse1 .cse2) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= .cse3 8) (<= .cse4 .cse5) (forall ((|v_ULTIMATE.start_main_~i~0#1_225| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_225|)) (forall ((v_ArrVal_766 Int)) (= (+ c_~N~0 2) (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_225|) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_766) (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (<= c_~N~0 3) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse6 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (= (+ (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|))) (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse6))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse2 .cse1) (<= .cse5 .cse4) (= (+ (- 1) .cse5) 4) (= |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2022-07-20 22:23:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:23:07,753 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2022-07-20 22:23:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-20 22:23:07,754 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-20 22:23:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:23:07,754 INFO L225 Difference]: With dead ends: 89 [2022-07-20 22:23:07,754 INFO L226 Difference]: Without dead ends: 87 [2022-07-20 22:23:07,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 118 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 3007 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=760, Invalid=8604, Unknown=40, NotChecked=4876, Total=14280 [2022-07-20 22:23:07,758 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 906 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 22:23:07,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 303 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 424 Invalid, 0 Unknown, 906 Unchecked, 0.3s Time] [2022-07-20 22:23:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-20 22:23:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2022-07-20 22:23:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:23:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-07-20 22:23:07,770 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 44 [2022-07-20 22:23:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:23:07,771 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-07-20 22:23:07,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:23:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-07-20 22:23:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 22:23:07,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:23:07,772 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:23:07,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-20 22:23:07,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-20 22:23:07,980 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:23:07,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:23:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1258986306, now seen corresponding path program 3 times [2022-07-20 22:23:07,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:23:07,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881871577] [2022-07-20 22:23:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:23:07,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:23:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:23:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:23:09,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:23:09,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881871577] [2022-07-20 22:23:09,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881871577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:23:09,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245505842] [2022-07-20 22:23:09,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:23:09,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:23:09,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:23:09,347 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:23:09,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 22:23:09,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 22:23:09,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:23:09,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-20 22:23:09,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:23:09,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-07-20 22:23:09,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-20 22:23:09,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:23:09,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:23:09,653 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 22:23:09,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 22:23:09,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:23:09,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-20 22:23:10,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:23:10,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-20 22:23:10,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:23:10,146 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 22:23:10,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 22:23:10,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:23:10,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:23:10,425 INFO L356 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2022-07-20 22:23:10,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 46 [2022-07-20 22:23:10,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:23:10,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:23:10,595 INFO L356 Elim1Store]: treesize reduction 39, result has 30.4 percent of original size [2022-07-20 22:23:10,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 57 [2022-07-20 22:23:10,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:23:10,769 INFO L356 Elim1Store]: treesize reduction 68, result has 44.7 percent of original size [2022-07-20 22:23:10,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 96 [2022-07-20 22:23:19,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:23:19,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:23:19,500 INFO L356 Elim1Store]: treesize reduction 39, result has 32.8 percent of original size [2022-07-20 22:23:19,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 96 [2022-07-20 22:23:22,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:23:22,932 INFO L356 Elim1Store]: treesize reduction 320, result has 18.6 percent of original size [2022-07-20 22:23:22,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 193 treesize of output 211 [2022-07-20 22:23:28,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:23:28,741 INFO L356 Elim1Store]: treesize reduction 580, result has 28.0 percent of original size [2022-07-20 22:23:28,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 237 treesize of output 368