./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/res1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/res1.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 f274a5aba9f5a53aba1b5bf0fd0b9cf2990c13e825cbbe6f7043cc6fa5a18df6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:07:51,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:07:51,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:07:51,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:07:51,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:07:51,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:07:51,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:07:51,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:07:51,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:07:51,934 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:07:51,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:07:51,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:07:51,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:07:51,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:07:51,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:07:51,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:07:51,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:07:51,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:07:51,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:07:51,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:07:51,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:07:51,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:07:51,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:07:51,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:07:51,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:07:51,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:07:51,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:07:51,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:07:51,982 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:07:51,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:07:51,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:07:51,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:07:51,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:07:51,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:07:51,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:07:51,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:07:51,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:07:51,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:07:51,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:07:51,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:07:51,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:07:51,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:07:52,012 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:07:52,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:07:52,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:07:52,015 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:07:52,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:07:52,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:07:52,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:07:52,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:07:52,016 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:07:52,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:07:52,017 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:07:52,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:07:52,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:07:52,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:07:52,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:07:52,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:07:52,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:07:52,018 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:07:52,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:07:52,018 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:07:52,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:07:52,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:07:52,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:07:52,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:07:52,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:07:52,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:07:52,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:07:52,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:07:52,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:07:52,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:07:52,020 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:07:52,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:07:52,020 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:07:52,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:07:52,021 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:07:52,021 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f274a5aba9f5a53aba1b5bf0fd0b9cf2990c13e825cbbe6f7043cc6fa5a18df6 [2023-02-15 10:07:52,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:07:52,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:07:52,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:07:52,283 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:07:52,284 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:07:52,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/res1.c [2023-02-15 10:07:53,583 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:07:53,766 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:07:53,766 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res1.c [2023-02-15 10:07:53,771 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9156aa5/a7790733e8ad41f28ea37e0bc788748b/FLAG83bae1844 [2023-02-15 10:07:53,781 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d9156aa5/a7790733e8ad41f28ea37e0bc788748b [2023-02-15 10:07:53,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:07:53,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:07:53,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:07:53,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:07:53,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:07:53,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:53,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6749ba7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53, skipping insertion in model container [2023-02-15 10:07:53,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:53,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:07:53,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:07:53,909 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res1.c[587,600] [2023-02-15 10:07:53,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:07:53,947 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:07:53,958 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/res1.c[587,600] [2023-02-15 10:07:53,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:07:53,977 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:07:53,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53 WrapperNode [2023-02-15 10:07:53,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:07:53,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:07:53,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:07:53,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:07:53,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:53,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:54,009 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-02-15 10:07:54,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:07:54,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:07:54,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:07:54,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:07:54,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:54,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:54,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:54,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:54,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:54,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:54,037 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:54,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:54,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:07:54,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:07:54,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:07:54,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:07:54,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (1/1) ... [2023-02-15 10:07:54,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:07:54,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:54,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:07:54,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:07:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:07:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:07:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:07:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:07:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:07:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:07:54,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:07:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:07:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:07:54,192 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:07:54,194 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:07:54,372 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:07:54,376 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:07:54,377 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 10:07:54,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:07:54 BoogieIcfgContainer [2023-02-15 10:07:54,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:07:54,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:07:54,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:07:54,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:07:54,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:07:53" (1/3) ... [2023-02-15 10:07:54,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de0628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:07:54, skipping insertion in model container [2023-02-15 10:07:54,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:07:53" (2/3) ... [2023-02-15 10:07:54,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1de0628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:07:54, skipping insertion in model container [2023-02-15 10:07:54,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:07:54" (3/3) ... [2023-02-15 10:07:54,389 INFO L112 eAbstractionObserver]: Analyzing ICFG res1.c [2023-02-15 10:07:54,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:07:54,401 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:07:54,447 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:07:54,453 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7238227f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:07:54,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:07:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 10:07:54,460 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:54,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:54,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1202110748, now seen corresponding path program 1 times [2023-02-15 10:07:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:54,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712645757] [2023-02-15 10:07:54,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:54,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:54,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:54,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712645757] [2023-02-15 10:07:54,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712645757] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:07:54,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:07:54,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:07:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384398641] [2023-02-15 10:07:54,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:07:54,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:07:54,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:54,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:07:54,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:07:54,628 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:54,639 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2023-02-15 10:07:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:07:54,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-02-15 10:07:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:54,659 INFO L225 Difference]: With dead ends: 44 [2023-02-15 10:07:54,660 INFO L226 Difference]: Without dead ends: 20 [2023-02-15 10:07:54,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:07:54,666 INFO L413 NwaCegarLoop]: 28 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, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:54,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:07:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-15 10:07:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-02-15 10:07:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-02-15 10:07:54,692 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2023-02-15 10:07:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:54,693 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-02-15 10:07:54,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-02-15 10:07:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 10:07:54,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:54,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:54,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:07:54,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:54,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:54,695 INFO L85 PathProgramCache]: Analyzing trace with hash -944124056, now seen corresponding path program 1 times [2023-02-15 10:07:54,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:54,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951217373] [2023-02-15 10:07:54,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:54,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:54,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951217373] [2023-02-15 10:07:54,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951217373] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:07:54,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:07:54,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:07:54,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33248149] [2023-02-15 10:07:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:07:54,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:07:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:07:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:07:54,903 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:54,979 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2023-02-15 10:07:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:07:54,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-02-15 10:07:54,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:54,982 INFO L225 Difference]: With dead ends: 41 [2023-02-15 10:07:54,982 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 10:07:54,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:07:54,987 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:54,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:07:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 10:07:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2023-02-15 10:07:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-02-15 10:07:54,999 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2023-02-15 10:07:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:55,003 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-02-15 10:07:55,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-02-15 10:07:55,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 10:07:55,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:55,005 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] [2023-02-15 10:07:55,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:07:55,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:55,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1401448688, now seen corresponding path program 1 times [2023-02-15 10:07:55,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:55,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870812549] [2023-02-15 10:07:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:56,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870812549] [2023-02-15 10:07:56,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870812549] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:07:56,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121907313] [2023-02-15 10:07:56,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:56,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:56,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:56,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:56,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:07:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:56,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 10:07:56,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:56,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:07:56,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:07:56,537 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-02-15 10:07:56,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:56,703 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 10:07:56,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 10:07:56,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:56,855 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:56,856 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 46 treesize of output 36 [2023-02-15 10:07:57,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:57,036 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:57,037 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 50 treesize of output 36 [2023-02-15 10:07:57,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:07:57,155 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:07:57,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2023-02-15 10:07:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:57,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:57,611 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:57,612 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:07:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:07:57,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121907313] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:57,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:07:57,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2023-02-15 10:07:57,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104487456] [2023-02-15 10:07:57,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:57,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 10:07:57,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:57,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 10:07:57,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2023-02-15 10:07:57,656 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:58,456 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-02-15 10:07:58,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:07:58,457 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 10:07:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:58,458 INFO L225 Difference]: With dead ends: 36 [2023-02-15 10:07:58,458 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 10:07:58,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=396, Invalid=1496, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 10:07:58,459 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 77 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:58,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 66 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:07:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 10:07:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-02-15 10:07:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-02-15 10:07:58,480 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2023-02-15 10:07:58,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:58,480 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-02-15 10:07:58,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-02-15 10:07:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 10:07:58,481 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:58,481 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] [2023-02-15 10:07:58,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:58,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:58,687 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:58,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1774307726, now seen corresponding path program 2 times [2023-02-15 10:07:58,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:58,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109542904] [2023-02-15 10:07:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:58,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:07:58,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:58,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109542904] [2023-02-15 10:07:58,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109542904] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:07:58,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773612935] [2023-02-15 10:07:58,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:07:58,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:58,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:58,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:58,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:07:58,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:07:58,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:58,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:07:58,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:07:58,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 10:07:58,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773612935] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:58,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:07:58,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:07:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316612427] [2023-02-15 10:07:58,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:58,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:07:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:07:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:07:58,881 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:58,978 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-02-15 10:07:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:07:58,979 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 10:07:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:58,979 INFO L225 Difference]: With dead ends: 73 [2023-02-15 10:07:58,979 INFO L226 Difference]: Without dead ends: 40 [2023-02-15 10:07:58,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:07:58,980 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:58,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 35 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:07:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-15 10:07:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2023-02-15 10:07:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-02-15 10:07:58,986 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2023-02-15 10:07:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:58,986 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-02-15 10:07:58,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-02-15 10:07:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 10:07:58,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:58,987 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:07:59,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 10:07:59,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-15 10:07:59,201 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:59,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:59,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1796008330, now seen corresponding path program 3 times [2023-02-15 10:07:59,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:59,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676965532] [2023-02-15 10:07:59,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:59,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:07:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:07:59,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:07:59,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676965532] [2023-02-15 10:07:59,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676965532] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:07:59,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552348793] [2023-02-15 10:07:59,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:07:59,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:07:59,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:07:59,272 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:07:59,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:07:59,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:07:59,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:07:59,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:07:59,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:07:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:07:59,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:07:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:07:59,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552348793] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:07:59,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:07:59,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:07:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547942285] [2023-02-15 10:07:59,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:07:59,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:07:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:07:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:07:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:07:59,409 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:07:59,487 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2023-02-15 10:07:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:07:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 10:07:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:07:59,488 INFO L225 Difference]: With dead ends: 39 [2023-02-15 10:07:59,488 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 10:07:59,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:07:59,489 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:07:59,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 22 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:07:59,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 10:07:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2023-02-15 10:07:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2023-02-15 10:07:59,495 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2023-02-15 10:07:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:07:59,496 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2023-02-15 10:07:59,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:07:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2023-02-15 10:07:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 10:07:59,496 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:07:59,496 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] [2023-02-15 10:07:59,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:07:59,702 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 [2023-02-15 10:07:59,703 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:07:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:07:59,704 INFO L85 PathProgramCache]: Analyzing trace with hash 666081912, now seen corresponding path program 4 times [2023-02-15 10:07:59,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:07:59,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433945624] [2023-02-15 10:07:59,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:07:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:07:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:08:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:08:01,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:08:01,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433945624] [2023-02-15 10:08:01,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433945624] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:08:01,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132111444] [2023-02-15 10:08:01,438 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:08:01,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:08:01,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:08:01,440 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) [2023-02-15 10:08:01,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:08:01,526 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:08:01,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:08:01,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-15 10:08:01,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:08:01,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:08:01,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:01,558 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:08:01,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2023-02-15 10:08:01,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:08:01,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:01,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 10:08:01,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:01,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:01,927 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:08:02,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:02,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:02,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:02,065 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 54 [2023-02-15 10:08:02,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:02,394 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:02,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:02,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:02,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2023-02-15 10:08:02,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:02,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:02,556 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2023-02-15 10:08:02,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:02,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:02,810 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:08:02,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2023-02-15 10:08:03,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:03,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2023-02-15 10:08:03,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:08:03,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2023-02-15 10:08:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:08:03,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:08:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:08:11,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132111444] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:08:11,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:08:11,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 64 [2023-02-15 10:08:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249959495] [2023-02-15 10:08:11,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:08:11,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-02-15 10:08:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:08:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-02-15 10:08:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3414, Unknown=2, NotChecked=0, Total=4032 [2023-02-15 10:08:11,075 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 64 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:08:18,901 WARN L233 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 191 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:08:21,026 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse13 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse31 (* c_~N~0 2)) (.cse32 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse16 (+ .cse32 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse11 (+ .cse31 1)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse20 (+ .cse32 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse17 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse21 (not .cse13)) (.cse0 (< 0 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (< |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int) (v_ArrVal_226 Int)) (let ((.cse1 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 .cse7 v_ArrVal_226)))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_231 (+ (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (< (+ v_ArrVal_235 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 5) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_226 1)))))) .cse8) (or (< 2 c_~N~0) (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse12 |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230)))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_231 (+ (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_230 1)) (< (+ v_ArrVal_235 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse11) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (not (< 1 c_~N~0))) (or .cse13 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 .cse16 v_ArrVal_230)))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_235 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse11) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_231 (+ (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (or .cse17 (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse12 .cse16 v_ArrVal_228) .cse20 v_ArrVal_230)))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_231 (+ (select (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (< (+ v_ArrVal_235 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse11))))) .cse21) (or (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse12 .cse20 v_ArrVal_230)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ v_ArrVal_235 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse11) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_231 (+ (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))) .cse17 .cse21) (or (< |c_ULTIMATE.start_main_~i~0#1| 1) (< 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int) (v_ArrVal_226 Int)) (let ((.cse24 (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 .cse27 v_ArrVal_226)))) (store .cse26 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_235 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 5) (not (<= v_ArrVal_231 (+ (select (select .cse24 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_226 1)) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (or .cse0 .cse8 (forall ((v_ArrVal_235 Int) (v_ArrVal_223 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int) (v_ArrVal_226 Int)) (let ((.cse29 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse6 .cse27 v_ArrVal_223) .cse7 v_ArrVal_226)))) (store .cse30 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230))))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_231 (+ (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_226 1)) (not (<= v_ArrVal_223 1)) (< (+ v_ArrVal_235 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 5)))))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse31)))) is different from true [2023-02-15 10:08:23,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:08:25,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:08:38,016 WARN L233 SmtUtils]: Spent 9.34s on a formula simplification that was a NOOP. DAG size: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:08:45,434 WARN L233 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:08:53,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:09:01,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:09:03,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:09:05,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:09:16,770 WARN L233 SmtUtils]: Spent 10.91s on a formula simplification that was a NOOP. DAG size: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:09:28,343 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:09:35,466 WARN L233 SmtUtils]: Spent 6.88s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:09:45,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:09:48,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:09:51,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:21,860 WARN L233 SmtUtils]: Spent 28.79s on a formula simplification. DAG size of input: 297 DAG size of output: 249 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:10:23,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:26,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:10:28,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:10:31,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:33,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:10:47,774 WARN L233 SmtUtils]: Spent 13.35s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:11:30,278 WARN L233 SmtUtils]: Spent 40.25s on a formula simplification. DAG size of input: 272 DAG size of output: 270 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:11:32,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:11:34,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:11:36,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 10:11:42,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:44,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:46,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 10:11:48,860 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (.cse35 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse14 (+ .cse35 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse12 (+ (* c_~N~0 2) 1)) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse24 (+ .cse35 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse21 (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (.cse25 (not .cse9)) (.cse0 (< 0 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (< |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse3 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse31 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int) (v_ArrVal_226 Int)) (let ((.cse1 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 .cse7 v_ArrVal_226)))) (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_231 (+ (select (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (< (+ v_ArrVal_235 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 5) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_226 1)))))) .cse8) (<= c_~N~0 2) (= |c_ULTIMATE.start_main_~#sum~0#1.offset| 0) (or .cse9 (not (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 .cse14 v_ArrVal_230)))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_235 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse12) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_231 (+ (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int) (|ULTIMATE.start_main_~b~0#1.base| Int)) (let ((.cse19 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (.cse20 (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse15 (select .cse20 4)) (.cse18 (select .cse20 0)) (.cse16 (select .cse19 0)) (.cse17 (select .cse19 4))) (and (<= (+ 2 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (+ .cse15 .cse16 .cse17 .cse18)) (<= .cse15 1) (<= .cse18 1) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= .cse16 1) (<= .cse17 1) (not (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)))))) (or .cse21 (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (store .cse13 .cse14 v_ArrVal_228) .cse24 v_ArrVal_230)))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_231 (+ (select (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (< (+ v_ArrVal_235 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse12))))) .cse25) (or (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store .cse13 .cse24 v_ArrVal_230)))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< (+ v_ArrVal_235 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) .cse12) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_231 (+ (select (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))) .cse21 .cse25) (or (< |c_ULTIMATE.start_main_~i~0#1| 1) (< 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int) (v_ArrVal_226 Int)) (let ((.cse28 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 .cse31 v_ArrVal_226)))) (store .cse30 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (< (+ v_ArrVal_235 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 5) (not (<= v_ArrVal_231 (+ (select (select .cse28 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_226 1)) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) (< 1 c_~N~0) (or .cse0 .cse8 (forall ((v_ArrVal_235 Int) (v_ArrVal_223 Int) (v_ArrVal_233 Int) (v_ArrVal_231 Int) (v_ArrVal_230 Int) (v_ArrVal_228 Int) (v_ArrVal_226 Int)) (let ((.cse33 (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse6 .cse31 v_ArrVal_223) .cse7 v_ArrVal_226)))) (store .cse34 |c_ULTIMATE.start_main_~b~0#1.base| (store (store (select .cse34 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| v_ArrVal_228) .cse4 v_ArrVal_230))))) (let ((.cse32 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_231 (+ (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= v_ArrVal_233 (+ v_ArrVal_231 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_231)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (<= v_ArrVal_235 (+ v_ArrVal_233 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_233)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (<= v_ArrVal_228 1)) (not (<= v_ArrVal_230 1)) (not (<= v_ArrVal_226 1)) (not (<= v_ArrVal_223 1)) (< (+ v_ArrVal_235 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_235)) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4)) 5))))))))) is different from true [2023-02-15 10:12:00,580 WARN L233 SmtUtils]: Spent 10.19s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:12:11,429 WARN L233 SmtUtils]: Spent 10.53s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:12:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:12:11,435 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2023-02-15 10:12:11,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-02-15 10:12:11,436 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 10:12:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:12:11,437 INFO L225 Difference]: With dead ends: 85 [2023-02-15 10:12:11,437 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 10:12:11,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 201.4s TimeCoverageRelationStatistics Valid=1830, Invalid=9941, Unknown=9, NotChecked=430, Total=12210 [2023-02-15 10:12:11,440 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 153 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 47.5s IncrementalHoareTripleChecker+Time [2023-02-15 10:12:11,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 110 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 900 Invalid, 20 Unknown, 6 Unchecked, 47.5s Time] [2023-02-15 10:12:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 10:12:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2023-02-15 10:12:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2023-02-15 10:12:11,464 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 31 [2023-02-15 10:12:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:12:11,464 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2023-02-15 10:12:11,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2023-02-15 10:12:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 10:12:11,465 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:12:11,465 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] [2023-02-15 10:12:11,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:12:11,666 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 [2023-02-15 10:12:11,666 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:12:11,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:12:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash 207824378, now seen corresponding path program 5 times [2023-02-15 10:12:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:12:11,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034922218] [2023-02-15 10:12:11,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:12:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:12:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034922218] [2023-02-15 10:12:11,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034922218] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:12:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965374050] [2023-02-15 10:12:11,765 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 10:12:11,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:11,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:12:11,781 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) [2023-02-15 10:12:11,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:12:11,856 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-15 10:12:11,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:12:11,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:12:11,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:12:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:12:11,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:12:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 10:12:12,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965374050] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:12:12,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:12:12,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 10:12:12,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056240939] [2023-02-15 10:12:12,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:12:12,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:12:12,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:12:12,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:12:12,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:12:12,050 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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) [2023-02-15 10:12:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:12:12,274 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2023-02-15 10:12:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 10:12:12,275 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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 33 [2023-02-15 10:12:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:12:12,275 INFO L225 Difference]: With dead ends: 118 [2023-02-15 10:12:12,275 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 10:12:12,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:12:12,276 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 77 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 10:12:12,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 34 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 10:12:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 10:12:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2023-02-15 10:12:12,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.1475409836065573) internal successors, (70), 61 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2023-02-15 10:12:12,296 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 33 [2023-02-15 10:12:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:12:12,296 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2023-02-15 10:12:12,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 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) [2023-02-15 10:12:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2023-02-15 10:12:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 10:12:12,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:12:12,301 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] [2023-02-15 10:12:12,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:12:12,507 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 [2023-02-15 10:12:12,507 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:12:12,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:12:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash 236928956, now seen corresponding path program 6 times [2023-02-15 10:12:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:12:12,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120692275] [2023-02-15 10:12:12,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:12:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 10:12:12,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:12,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120692275] [2023-02-15 10:12:12,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120692275] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:12:12,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010551328] [2023-02-15 10:12:12,607 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 10:12:12,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:12,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:12:12,615 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) [2023-02-15 10:12:12,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:12:12,684 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-15 10:12:12,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:12:12,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:12:12,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:12:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 10:12:12,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:12:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 10:12:12,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010551328] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:12:12,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:12:12,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 10:12:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820527698] [2023-02-15 10:12:12,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:12:12,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:12:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:12:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:12:12,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:12:12,826 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:13,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:12:13,022 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2023-02-15 10:12:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:12:13,022 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 10:12:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:12:13,024 INFO L225 Difference]: With dead ends: 71 [2023-02-15 10:12:13,024 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 10:12:13,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-15 10:12:13,025 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:12:13,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 24 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:12:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 10:12:13,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2023-02-15 10:12:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-02-15 10:12:13,038 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 35 [2023-02-15 10:12:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:12:13,039 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-02-15 10:12:13,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:12:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-02-15 10:12:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 10:12:13,041 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:12:13,041 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] [2023-02-15 10:12:13,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 10:12:13,246 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 [2023-02-15 10:12:13,246 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:12:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:12:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash 315843584, now seen corresponding path program 7 times [2023-02-15 10:12:13,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:12:13,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860336704] [2023-02-15 10:12:13,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:12:13,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:12:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:16,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860336704] [2023-02-15 10:12:16,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860336704] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:12:16,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355041255] [2023-02-15 10:12:16,654 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 10:12:16,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:16,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:12:16,655 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) [2023-02-15 10:12:16,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:12:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:16,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-15 10:12:16,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:12:16,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:12:16,829 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:12:16,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-02-15 10:12:16,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:12:17,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2023-02-15 10:12:17,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:17,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:17,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-02-15 10:12:17,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:17,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:17,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2023-02-15 10:12:17,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:17,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:17,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 71 [2023-02-15 10:12:17,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:17,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:17,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:17,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:17,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 76 [2023-02-15 10:12:18,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,072 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:12:18,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 88 [2023-02-15 10:12:18,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:12:18,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2023-02-15 10:12:18,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2023-02-15 10:12:19,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:19,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:19,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:19,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:12:19,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2023-02-15 10:12:19,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:19,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:19,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:19,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:19,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:12:19,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2023-02-15 10:12:19,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 81 [2023-02-15 10:12:20,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 31 [2023-02-15 10:12:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:20,084 INFO L328 TraceCheckSpWp]: Computing backward predicates...