./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/sina4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 02:21:22,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 02:21:22,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 02:21:22,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 02:21:22,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 02:21:22,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 02:21:22,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 02:21:22,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 02:21:22,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 02:21:22,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 02:21:22,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 02:21:22,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 02:21:22,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 02:21:22,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 02:21:22,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 02:21:22,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 02:21:22,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 02:21:22,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 02:21:22,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 02:21:22,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 02:21:22,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 02:21:22,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 02:21:22,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 02:21:22,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 02:21:22,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 02:21:22,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 02:21:22,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 02:21:22,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 02:21:22,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 02:21:22,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 02:21:22,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 02:21:22,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 02:21:22,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 02:21:22,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 02:21:22,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 02:21:22,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 02:21:22,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 02:21:22,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 02:21:22,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 02:21:22,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 02:21:22,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 02:21:22,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 02:21:22,175 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 02:21:22,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 02:21:22,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 02:21:22,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 02:21:22,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 02:21:22,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 02:21:22,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 02:21:22,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 02:21:22,179 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 02:21:22,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 02:21:22,180 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 02:21:22,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 02:21:22,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 02:21:22,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 02:21:22,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 02:21:22,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 02:21:22,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 02:21:22,181 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 02:21:22,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 02:21:22,182 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 02:21:22,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 02:21:22,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 02:21:22,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 02:21:22,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 02:21:22,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:21:22,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 02:21:22,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 02:21:22,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 02:21:22,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 02:21:22,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 02:21:22,183 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 02:21:22,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 02:21:22,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 02:21:22,184 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 02:21:22,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 [2021-12-17 02:21:22,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 02:21:22,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 02:21:22,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 02:21:22,437 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 02:21:22,437 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 02:21:22,439 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina4.c [2021-12-17 02:21:22,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe64b388/5321f7e48eec424aa7857bc058cf18df/FLAG0d03d6383 [2021-12-17 02:21:22,833 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 02:21:22,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c [2021-12-17 02:21:22,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe64b388/5321f7e48eec424aa7857bc058cf18df/FLAG0d03d6383 [2021-12-17 02:21:22,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe64b388/5321f7e48eec424aa7857bc058cf18df [2021-12-17 02:21:22,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 02:21:22,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 02:21:22,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 02:21:22,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 02:21:22,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 02:21:22,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:21:22" (1/1) ... [2021-12-17 02:21:22,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7748694b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:22, skipping insertion in model container [2021-12-17 02:21:22,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:21:22" (1/1) ... [2021-12-17 02:21:22,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 02:21:22,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 02:21:23,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c[588,601] [2021-12-17 02:21:23,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:21:23,050 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 02:21:23,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c[588,601] [2021-12-17 02:21:23,079 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 02:21:23,091 INFO L208 MainTranslator]: Completed translation [2021-12-17 02:21:23,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23 WrapperNode [2021-12-17 02:21:23,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 02:21:23,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 02:21:23,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 02:21:23,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 02:21:23,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (1/1) ... [2021-12-17 02:21:23,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (1/1) ... [2021-12-17 02:21:23,129 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2021-12-17 02:21:23,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 02:21:23,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 02:21:23,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 02:21:23,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 02:21:23,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (1/1) ... [2021-12-17 02:21:23,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (1/1) ... [2021-12-17 02:21:23,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (1/1) ... [2021-12-17 02:21:23,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (1/1) ... [2021-12-17 02:21:23,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (1/1) ... [2021-12-17 02:21:23,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (1/1) ... [2021-12-17 02:21:23,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (1/1) ... [2021-12-17 02:21:23,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 02:21:23,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 02:21:23,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 02:21:23,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 02:21:23,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (1/1) ... [2021-12-17 02:21:23,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 02:21:23,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:21:23,209 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) [2021-12-17 02:21:23,228 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 [2021-12-17 02:21:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 02:21:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 02:21:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 02:21:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 02:21:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 02:21:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 02:21:23,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 02:21:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 02:21:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 02:21:23,301 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 02:21:23,302 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 02:21:23,404 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 02:21:23,413 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 02:21:23,413 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-17 02:21:23,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:21:23 BoogieIcfgContainer [2021-12-17 02:21:23,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 02:21:23,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 02:21:23,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 02:21:23,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 02:21:23,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:21:22" (1/3) ... [2021-12-17 02:21:23,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11078e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:21:23, skipping insertion in model container [2021-12-17 02:21:23,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:21:23" (2/3) ... [2021-12-17 02:21:23,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11078e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:21:23, skipping insertion in model container [2021-12-17 02:21:23,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:21:23" (3/3) ... [2021-12-17 02:21:23,423 INFO L111 eAbstractionObserver]: Analyzing ICFG sina4.c [2021-12-17 02:21:23,428 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 02:21:23,429 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 02:21:23,482 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 02:21:23,487 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 02:21:23,487 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 02:21:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:23,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 02:21:23,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:21:23,505 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:21:23,509 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:21:23,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:21:23,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2021-12-17 02:21:23,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:21:23,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491783287] [2021-12-17 02:21:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:21:23,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:21:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:21:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:21:23,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:21:23,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491783287] [2021-12-17 02:21:23,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491783287] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:21:23,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:21:23,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 02:21:23,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040493930] [2021-12-17 02:21:23,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:21:23,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 02:21:23,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:21:23,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 02:21:23,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 02:21:23,708 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:21:23,718 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2021-12-17 02:21:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 02:21:23,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-17 02:21:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:21:23,724 INFO L225 Difference]: With dead ends: 50 [2021-12-17 02:21:23,724 INFO L226 Difference]: Without dead ends: 23 [2021-12-17 02:21:23,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 02:21:23,730 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 02:21:23,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 02:21:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-17 02:21:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-17 02:21:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-17 02:21:23,755 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2021-12-17 02:21:23,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:21:23,755 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-17 02:21:23,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-17 02:21:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-17 02:21:23,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:21:23,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:21:23,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 02:21:23,757 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:21:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:21:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2021-12-17 02:21:23,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:21:23,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321876801] [2021-12-17 02:21:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:21:23,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:21:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:21:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:21:23,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:21:23,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321876801] [2021-12-17 02:21:23,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321876801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 02:21:23,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 02:21:23,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 02:21:23,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396618665] [2021-12-17 02:21:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 02:21:23,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 02:21:23,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:21:23,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 02:21:23,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-17 02:21:23,846 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:21:23,916 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2021-12-17 02:21:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 02:21:23,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-17 02:21:23,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:21:23,920 INFO L225 Difference]: With dead ends: 53 [2021-12-17 02:21:23,921 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 02:21:23,921 INFO L932 BasicCegarLoop]: 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 [2021-12-17 02:21:23,929 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:21:23,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:21:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 02:21:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2021-12-17 02:21:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-12-17 02:21:23,945 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2021-12-17 02:21:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:21:23,945 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-12-17 02:21:23,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-12-17 02:21:23,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-17 02:21:23,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:21:23,947 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:21:23,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 02:21:23,947 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:21:23,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:21:23,948 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2021-12-17 02:21:23,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:21:23,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574203562] [2021-12-17 02:21:23,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:21:23,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:21:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:21:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:21:24,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:21:24,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574203562] [2021-12-17 02:21:24,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574203562] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:21:24,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299779108] [2021-12-17 02:21:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:21:24,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:21:24,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:21:24,752 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) [2021-12-17 02:21:24,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 02:21:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:21:24,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-17 02:21:24,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:21:24,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-17 02:21:24,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:21:24,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:21:25,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-12-17 02:21:25,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2021-12-17 02:21:25,440 INFO L354 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2021-12-17 02:21:25,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2021-12-17 02:21:26,005 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:21:26,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 61 [2021-12-17 02:21:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:21:26,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:21:54,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:21:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:21:54,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299779108] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:21:54,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:21:54,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2021-12-17 02:21:54,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128166216] [2021-12-17 02:21:54,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:21:54,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-17 02:21:54,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:21:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-17 02:21:54,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=954, Unknown=12, NotChecked=0, Total=1122 [2021-12-17 02:21:54,577 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 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) [2021-12-17 02:21:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:21:54,898 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2021-12-17 02:21:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 02:21:54,899 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-17 02:21:54,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:21:54,899 INFO L225 Difference]: With dead ends: 53 [2021-12-17 02:21:54,899 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 02:21:54,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=185, Invalid=1063, Unknown=12, NotChecked=0, Total=1260 [2021-12-17 02:21:54,901 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:21:54,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 117 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 278 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2021-12-17 02:21:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 02:21:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2021-12-17 02:21:54,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:54,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-17 02:21:54,906 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 24 [2021-12-17 02:21:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:21:54,906 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-17 02:21:54,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 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) [2021-12-17 02:21:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-17 02:21:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 02:21:54,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:21:54,907 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:21:54,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 02:21:55,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:21:55,120 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:21:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:21:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2021-12-17 02:21:55,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:21:55,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265029940] [2021-12-17 02:21:55,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:21:55,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:21:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:21:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:21:55,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:21:55,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265029940] [2021-12-17 02:21:55,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265029940] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:21:55,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791442971] [2021-12-17 02:21:55,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:21:55,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:21:55,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:21:55,184 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) [2021-12-17 02:21:55,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 02:21:55,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:21:55,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:21:55,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:21:55,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:21:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:21:55,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:21:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:21:55,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791442971] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:21:55,365 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:21:55,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 02:21:55,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314908100] [2021-12-17 02:21:55,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:21:55,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 02:21:55,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:21:55,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 02:21:55,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 02:21:55,367 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:21:55,478 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2021-12-17 02:21:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:21:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 02:21:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:21:55,479 INFO L225 Difference]: With dead ends: 101 [2021-12-17 02:21:55,479 INFO L226 Difference]: Without dead ends: 66 [2021-12-17 02:21:55,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-17 02:21:55,481 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 84 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:21:55,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 46 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:21:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-17 02:21:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2021-12-17 02:21:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2021-12-17 02:21:55,485 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2021-12-17 02:21:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:21:55,485 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2021-12-17 02:21:55,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2021-12-17 02:21:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-17 02:21:55,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:21:55,487 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:21:55,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 02:21:55,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 02:21:55,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:21:55,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:21:55,696 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2021-12-17 02:21:55,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:21:55,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520529561] [2021-12-17 02:21:55,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:21:55,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:21:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:21:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:21:55,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:21:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520529561] [2021-12-17 02:21:55,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520529561] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:21:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126044329] [2021-12-17 02:21:55,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:21:55,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:21:55,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:21:55,760 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) [2021-12-17 02:21:55,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 02:21:55,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 02:21:55,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:21:55,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 02:21:55,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:21:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:21:55,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:21:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 02:21:55,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126044329] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:21:55,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:21:55,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-17 02:21:55,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198847073] [2021-12-17 02:21:55,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:21:55,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 02:21:55,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:21:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 02:21:55,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-17 02:21:55,932 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:21:56,040 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-12-17 02:21:56,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 02:21:56,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-17 02:21:56,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:21:56,040 INFO L225 Difference]: With dead ends: 63 [2021-12-17 02:21:56,041 INFO L226 Difference]: Without dead ends: 50 [2021-12-17 02:21:56,041 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-17 02:21:56,041 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 88 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:21:56,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 47 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:21:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-17 02:21:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2021-12-17 02:21:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-12-17 02:21:56,045 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2021-12-17 02:21:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:21:56,045 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-12-17 02:21:56,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:21:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-12-17 02:21:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-17 02:21:56,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:21:56,046 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:21:56,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 02:21:56,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:21:56,255 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:21:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:21:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2021-12-17 02:21:56,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:21:56,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270809446] [2021-12-17 02:21:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:21:56,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:21:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:21:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:21:57,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:21:57,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270809446] [2021-12-17 02:21:57,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270809446] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:21:57,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331203999] [2021-12-17 02:21:57,251 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 02:21:57,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:21:57,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:21:57,252 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) [2021-12-17 02:21:57,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 02:21:57,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 02:21:57,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:21:57,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-17 02:21:57,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:21:57,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:21:57,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:57,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:21:57,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:57,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:57,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2021-12-17 02:21:57,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:57,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:21:57,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:57,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-12-17 02:21:57,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:57,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:57,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2021-12-17 02:21:57,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:57,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:21:57,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:57,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2021-12-17 02:21:58,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:58,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:58,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:58,084 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-12-17 02:21:58,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 54 [2021-12-17 02:21:58,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:58,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:21:58,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:21:58,286 INFO L354 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2021-12-17 02:21:58,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 56 [2021-12-17 02:21:58,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:58,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:58,667 INFO L354 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2021-12-17 02:21:58,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2021-12-17 02:21:59,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:21:59,169 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:21:59,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2021-12-17 02:21:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:21:59,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:22:01,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) (< |v_ULTIMATE.start_main_~i~0#1_69| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:22:03,379 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (= (select (store (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse0) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)) (< |v_ULTIMATE.start_main_~i~0#1_69| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:22:05,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_224 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_69| 1) (= (select (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 8)) v_ArrVal_224))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)))) (< |v_ULTIMATE.start_main_~i~0#1_72| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:22:06,190 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_224 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_72| Int) (v_ArrVal_227 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_69| 1) (= (select (store (let ((.cse0 (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 8)) v_ArrVal_224))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)) (< |v_ULTIMATE.start_main_~i~0#1_72| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:22:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-12-17 02:22:08,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331203999] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:22:08,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:22:08,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 22] total 63 [2021-12-17 02:22:08,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999006567] [2021-12-17 02:22:08,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:22:08,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2021-12-17 02:22:08,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:22:08,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-12-17 02:22:08,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=3140, Unknown=4, NotChecked=468, Total=3906 [2021-12-17 02:22:08,272 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 63 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:10,582 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (select .cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse7 (+ c_~N~0 1)) (.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_224 Int) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_227 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_69| 1) (= (select (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 8)) v_ArrVal_224))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)))) (< |v_ULTIMATE.start_main_~i~0#1_72| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) (* 2 .cse1)) (= .cse1 2)))) (or (let ((.cse4 (select .cse5 0))) (let ((.cse3 (+ c_~N~0 .cse4)) (.cse2 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (and (<= .cse2 .cse3) (<= .cse3 .cse2) (= .cse4 1)))) (not (= 8 .cse6))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (< 7 .cse6) (<= 2 c_~N~0)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (<= .cse7 .cse8) (< 1 c_~N~0) (= (select .cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1) (<= .cse8 .cse7) (<= c_~N~0 2) (<= .cse6 8) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2021-12-17 02:22:16,757 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))))) (and (= .cse0 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_69| Int)) (or (forall ((v_ArrVal_227 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 8)) v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) (< |v_ULTIMATE.start_main_~i~0#1_69| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= .cse0 (+ c_~N~0 2)) (< 1 c_~N~0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (<= c_~N~0 2) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~a~0#1.base| Int)) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2)) (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (< (+ |ULTIMATE.start_main_~a~0#1.base| 1) |ULTIMATE.start_main_~#sum~0#1.base|) (or (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|) (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse1) 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse1))))))))) is different from false [2021-12-17 02:22:16,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:22:16,910 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-12-17 02:22:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 02:22:16,919 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-17 02:22:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:22:16,923 INFO L225 Difference]: With dead ends: 65 [2021-12-17 02:22:16,923 INFO L226 Difference]: Without dead ends: 63 [2021-12-17 02:22:16,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=356, Invalid=3822, Unknown=6, NotChecked=786, Total=4970 [2021-12-17 02:22:16,928 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 386 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:22:16,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 157 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 283 Invalid, 0 Unknown, 386 Unchecked, 0.2s Time] [2021-12-17 02:22:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-17 02:22:16,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2021-12-17 02:22:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 57 states have internal predecessors, (66), 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) [2021-12-17 02:22:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2021-12-17 02:22:16,947 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 32 [2021-12-17 02:22:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:22:16,947 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2021-12-17 02:22:16,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2021-12-17 02:22:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 02:22:16,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:22:16,949 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:22:16,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-17 02:22:17,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:17,153 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:22:17,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:22:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2147373800, now seen corresponding path program 5 times [2021-12-17 02:22:17,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:22:17,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315796987] [2021-12-17 02:22:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:22:17,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:22:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:22:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:17,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:22:17,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315796987] [2021-12-17 02:22:17,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315796987] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:22:17,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281556928] [2021-12-17 02:22:17,267 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-17 02:22:17,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:22:17,269 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) [2021-12-17 02:22:17,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 02:22:17,419 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-17 02:22:17,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:22:17,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:22:17,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:22:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:17,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:22:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:17,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281556928] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:22:17,575 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:22:17,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 02:22:17,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965365049] [2021-12-17 02:22:17,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:22:17,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 02:22:17,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:22:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 02:22:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:22:17,578 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:22:17,761 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2021-12-17 02:22:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 02:22:17,762 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-17 02:22:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:22:17,763 INFO L225 Difference]: With dead ends: 135 [2021-12-17 02:22:17,763 INFO L226 Difference]: Without dead ends: 111 [2021-12-17 02:22:17,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:22:17,764 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 100 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:22:17,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 75 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:22:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-17 02:22:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2021-12-17 02:22:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1219512195121952) internal successors, (92), 82 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2021-12-17 02:22:17,774 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 34 [2021-12-17 02:22:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:22:17,774 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2021-12-17 02:22:17,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2021-12-17 02:22:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-17 02:22:17,775 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:22:17,776 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:22:17,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-17 02:22:17,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:17,998 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:22:17,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:22:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1205583320, now seen corresponding path program 6 times [2021-12-17 02:22:18,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:22:18,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262396442] [2021-12-17 02:22:18,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:22:18,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:22:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:22:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:18,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:22:18,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262396442] [2021-12-17 02:22:18,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262396442] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:22:18,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137445134] [2021-12-17 02:22:18,086 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-17 02:22:18,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:18,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:22:18,088 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) [2021-12-17 02:22:18,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 02:22:18,147 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-17 02:22:18,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:22:18,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 02:22:18,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:22:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:18,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:22:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-17 02:22:18,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137445134] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:22:18,324 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:22:18,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-17 02:22:18,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485604290] [2021-12-17 02:22:18,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:22:18,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 02:22:18,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:22:18,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 02:22:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-17 02:22:18,327 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:18,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:22:18,518 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2021-12-17 02:22:18,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 02:22:18,519 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-17 02:22:18,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:22:18,520 INFO L225 Difference]: With dead ends: 112 [2021-12-17 02:22:18,520 INFO L226 Difference]: Without dead ends: 91 [2021-12-17 02:22:18,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-17 02:22:18,522 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 118 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:22:18,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 101 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 02:22:18,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-17 02:22:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2021-12-17 02:22:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 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) [2021-12-17 02:22:18,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2021-12-17 02:22:18,536 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2021-12-17 02:22:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:22:18,536 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2021-12-17 02:22:18,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:22:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2021-12-17 02:22:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 02:22:18,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:22:18,538 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:22:18,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-17 02:22:18,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:18,762 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:22:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:22:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2021-12-17 02:22:18,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:22:18,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352732535] [2021-12-17 02:22:18,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:22:18,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:22:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:22:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:22:20,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:22:20,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352732535] [2021-12-17 02:22:20,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352732535] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:22:20,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889604070] [2021-12-17 02:22:20,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:22:20,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:22:20,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:22:20,322 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) [2021-12-17 02:22:20,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 02:22:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:22:20,377 WARN L261 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-17 02:22:20,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:22:20,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:22:20,399 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 02:22:20,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-12-17 02:22:20,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:22:20,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:20,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 02:22:20,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:22:20,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:20,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-12-17 02:22:20,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:20,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2021-12-17 02:22:20,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:22:20,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:20,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 43 [2021-12-17 02:22:21,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:21,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2021-12-17 02:22:21,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:22:21,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:21,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2021-12-17 02:22:21,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:22:21,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:22:21,462 INFO L354 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2021-12-17 02:22:21,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 60 [2021-12-17 02:22:22,022 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-12-17 02:22:22,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 38 [2021-12-17 02:22:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:22:22,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:22:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:22:25,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889604070] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:22:25,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:22:25,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 23] total 70 [2021-12-17 02:22:25,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946660382] [2021-12-17 02:22:25,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:22:25,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2021-12-17 02:22:25,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:22:25,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-12-17 02:22:25,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=4483, Unknown=0, NotChecked=0, Total=4830 [2021-12-17 02:22:25,407 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 70 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 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) [2021-12-17 02:22:29,264 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse98 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse43 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse44 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse58 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select .cse44 .cse58)) (.cse10 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (+ .cse9 .cse10))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse59))) (.cse53 (select .cse44 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse100 (select .cse44 0)) (.cse99 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse32 (not (= 8 .cse99))) (.cse28 (+ c_~N~0 .cse100)) (.cse26 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse29 (= .cse100 1)) (.cse30 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) (.cse31 (= .cse9 1)) (.cse33 (<= .cse99 8)) (.cse34 (< 2 c_~N~0)) (.cse27 (+ .cse10 .cse53)) (.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse25 (+ .cse98 |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse24 (store .cse44 .cse58 1))) (and (let ((.cse5 (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse9 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse10)))) (store .cse7 .cse4 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse4)))))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse1 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse0 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse0 (select (store .cse1 .cse2 .cse0) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse23 (store .cse24 .cse25 1))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse15 (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse18 .cse19 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse20))))) (store .cse16 .cse4 (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse16 .cse4)))))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse12 (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse11 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse11 (select (store .cse12 .cse2 .cse11) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))))) (or (and (or (and .cse26 (<= .cse27 (+ c_~N~0 1)) (<= .cse28 (+ .cse10 1)) .cse29 .cse30 .cse31) .cse32) .cse33) .cse34) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (and (or .cse32 (and (<= .cse27 c_~N~0) (<= .cse28 (+ .cse10 2)) .cse26 .cse29 .cse30 .cse31)) .cse33) .cse34) (let ((.cse42 (select .cse44 .cse25))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse42))))) (let ((.cse38 (let ((.cse40 (let ((.cse41 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse10 .cse42))))) (store .cse40 .cse4 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse40 .cse4)))))) (let ((.cse37 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse38))) (let ((.cse36 (store (select .cse37 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse35 (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~b~0#1.base| .cse36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse35 (select (store .cse36 .cse2 .cse35) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (let ((.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse27)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse10 .cse53))))) (let ((.cse48 (let ((.cse50 (let ((.cse51 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse52 .cse10 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse53))))) (store .cse50 .cse4 (+ (select (select (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| .cse50) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse50 .cse4)))))) (let ((.cse47 (store .cse49 |c_ULTIMATE.start_main_~a~0#1.base| .cse48))) (let ((.cse46 (store (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse45 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~b~0#1.base| .cse46) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse45 (select (store .cse46 .cse2 .cse45) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (let ((.cse57 (store .cse44 .cse58 .cse59))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse57))) (let ((.cse55 (store (select .cse56 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse57 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse54 (+ (select (select (store .cse56 |c_ULTIMATE.start_main_~b~0#1.base| .cse55) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse54 (select (store .cse55 .cse2 .cse54) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse63 (let ((.cse64 (store .cse44 |c_ULTIMATE.start_main_~a~0#1.offset| .cse27))) (store .cse64 .cse4 (+ (select .cse64 .cse4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse64) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse63))) (let ((.cse61 (store (select .cse62 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse60 (+ (select (select (store .cse62 |c_ULTIMATE.start_main_~b~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse60 (select (store .cse61 .cse2 .cse60) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse72 (select .cse8 .cse25))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse72 .cse10))))) (let ((.cse68 (let ((.cse70 (let ((.cse71 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse71 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse9 .cse72 .cse10 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse70 .cse4 (+ (select .cse70 .cse4) (select (select (store .cse69 |c_ULTIMATE.start_main_~a~0#1.base| .cse70) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse67 (store .cse69 |c_ULTIMATE.start_main_~a~0#1.base| .cse68))) (let ((.cse66 (store (select .cse67 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse65 (+ (select (select (store .cse67 |c_ULTIMATE.start_main_~b~0#1.base| .cse66) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse65 (select (store .cse66 .cse2 .cse65) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (<= 2 c_~N~0) (let ((.cse85 (store .cse44 .cse25 1))) (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse85))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse81 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse82 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse80 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse77 (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse82))))) (let ((.cse76 (let ((.cse78 (let ((.cse79 (select .cse77 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse79 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse80 (select .cse79 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse81 .cse82))))) (store .cse78 .cse4 (+ (select (select (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| .cse78) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse78 .cse4)))))) (let ((.cse75 (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| .cse76))) (let ((.cse74 (store (select .cse75 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse73 (+ (select (select (store .cse75 |c_ULTIMATE.start_main_~b~0#1.base| .cse74) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse73 (select (store .cse74 .cse2 .cse73) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))))) (let ((.cse96 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24))) (let ((.cse97 (select .cse96 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse93 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse95 (select .cse97 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse94 (select (select (store .cse96 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse90 (store .cse96 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse94 .cse95))))) (let ((.cse89 (let ((.cse91 (let ((.cse92 (select .cse90 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse92 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse93 .cse94 (select .cse92 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse95))))) (store .cse91 .cse4 (+ (select .cse91 .cse4) (select (select (store .cse90 |c_ULTIMATE.start_main_~a~0#1.base| .cse91) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse88 (store .cse90 |c_ULTIMATE.start_main_~a~0#1.base| .cse89))) (let ((.cse87 (store (select .cse88 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse86 (+ (select (select (store .cse88 |c_ULTIMATE.start_main_~b~0#1.base| .cse87) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse86 (select (store .cse87 .cse2 .cse86) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))))))) is different from true [2021-12-17 02:22:31,995 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse34 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse72 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse18 (+ .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse11 (select .cse17 (+ .cse72 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse12 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse58 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse43 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12)))) (.cse33 (select .cse17 .cse18))) (let ((.cse19 (+ .cse12 .cse33)) (.cse10 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse44 (+ .cse12 .cse43)) (.cse21 (+ c_~N~0 1)) (.cse20 (select .cse17 0)) (.cse23 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) (.cse25 (<= 2 c_~N~0)) (.cse24 (+ .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (+ .cse1 1)) (= .cse1 2) (= (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (* 2 .cse1)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~#sum~0#1.base|))))) (let ((.cse7 (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse11 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse12)))) (store .cse9 .cse6 (+ (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse6)))))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| .cse7))) (let ((.cse3 (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse2 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (= .cse2 (select (store .cse3 .cse4 .cse2) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse16 (store .cse17 .cse18 .cse19))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16))) (let ((.cse14 (store (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse13 (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~b~0#1.base| .cse14) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (= .cse13 (select (store .cse14 .cse4 .cse13) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (<= (+ |c_ULTIMATE.start_main_~i~0#1| 2) c_~N~0) (and (<= .cse20 .cse21) (<= .cse21 .cse20) .cse22 (<= .cse11 .cse21) .cse23 (<= .cse21 .cse11))) (or (< 7 .cse24) .cse25) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse19)))) (let ((.cse29 (let ((.cse31 (let ((.cse32 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse12 .cse33))))) (store .cse31 .cse6 (+ (select (select (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| .cse31) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse31 .cse6)))))) (let ((.cse28 (store .cse30 |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (let ((.cse27 (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse26 (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (= .cse26 (select (store .cse27 .cse4 .cse26) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse44)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse12 .cse43))))) (let ((.cse38 (let ((.cse40 (let ((.cse41 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse42 .cse12 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse43))))) (store .cse40 .cse6 (+ (select (select (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse40 .cse6)))))) (let ((.cse37 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.base| .cse38))) (let ((.cse36 (store (select .cse37 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse35 (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~b~0#1.base| .cse36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (= .cse35 (select (store .cse36 .cse4 .cse35) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (let ((.cse48 (let ((.cse49 (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44))) (store .cse49 .cse6 (+ (select .cse49 .cse6) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse48))) (let ((.cse46 (store (select .cse47 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse45 (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~b~0#1.base| .cse46) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (= .cse45 (select (store .cse46 .cse4 .cse45) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse57 (select .cse10 .cse18))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse57 .cse12))))) (let ((.cse53 (let ((.cse55 (let ((.cse56 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse56 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse11 .cse57 .cse12 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse55 .cse6 (+ (select .cse55 .cse6) (select (select (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| .cse55) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse52 (store .cse54 |c_ULTIMATE.start_main_~a~0#1.base| .cse53))) (let ((.cse51 (store (select .cse52 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse50 (+ (select (select (store .cse52 |c_ULTIMATE.start_main_~b~0#1.base| .cse51) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (= .cse50 (select (store .cse51 .cse4 .cse50) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (or (< 2 c_~N~0) (and (= (select .cse17 8) 1) .cse22 (<= .cse44 .cse21) (<= (+ c_~N~0 .cse20) (+ .cse12 1)) (= .cse20 1) .cse23) (<= (+ .cse58 |c_ULTIMATE.start_main_~a~0#1.offset| 1) (* 8 c_~N~0))) .cse25 (<= .cse24 8) (let ((.cse71 (store .cse17 .cse18 1))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse71))) (let ((.cse70 (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse67 (select .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse68 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse66 (select (select (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse68))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse63 (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse70 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse67 .cse68))))) (let ((.cse62 (let ((.cse64 (let ((.cse65 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse65 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse66 (select .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse67 .cse68))))) (store .cse64 .cse6 (+ (select (select (store .cse63 |c_ULTIMATE.start_main_~a~0#1.base| .cse64) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse64 .cse6)))))) (let ((.cse61 (store .cse63 |c_ULTIMATE.start_main_~a~0#1.base| .cse62))) (let ((.cse60 (store (select .cse61 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse62 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse59 (+ (select (select (store .cse61 |c_ULTIMATE.start_main_~b~0#1.base| .cse60) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (= .cse59 (select (store .cse60 .cse4 .cse59) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))))) is different from true [2021-12-17 02:22:34,781 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse100 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse42 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse30 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse98 (+ .cse100 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select .cse30 .cse98)) (.cse10 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (+ .cse100 |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse99 (+ .cse9 .cse10))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse99))) (.cse57 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse47 (store .cse30 .cse98 .cse99)) (.cse41 (select .cse30 .cse25))) (let ((.cse31 (+ .cse10 .cse41)) (.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse47)) (.cse32 (+ .cse10 .cse57)) (.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse24 (store .cse30 .cse98 1))) (and (let ((.cse5 (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse9 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse10)))) (store .cse7 .cse4 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse4)))))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse1 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse0 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse0 (select (store .cse1 .cse2 .cse0) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse23 (store .cse24 .cse25 1))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse15 (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse19 .cse20))))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse18 .cse19 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse20))))) (store .cse16 .cse4 (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse16 .cse4)))))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse12 (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse11 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse11 (select (store .cse12 .cse2 .cse11) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))))) (let ((.cse29 (store .cse30 .cse25 .cse31))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29))) (let ((.cse27 (store (select .cse28 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse26 (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~b~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse26 (select (store .cse27 .cse2 .cse26) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (or (< 2 c_~N~0) (let ((.cse33 (select .cse30 0))) (and (= (select .cse30 8) 1) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (<= .cse32 (+ c_~N~0 1)) (<= (+ c_~N~0 .cse33) (+ .cse10 1)) (= .cse33 1) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31)))) (let ((.cse37 (let ((.cse39 (let ((.cse40 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse10 .cse41))))) (store .cse39 .cse4 (+ (select (select (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse39 .cse4)))))) (let ((.cse36 (store .cse38 |c_ULTIMATE.start_main_~a~0#1.base| .cse37))) (let ((.cse35 (store (select .cse36 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse34 (+ (select (select (store .cse36 |c_ULTIMATE.start_main_~b~0#1.base| .cse35) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse34 (select (store .cse35 .cse2 .cse34) |c_ULTIMATE.start_main_~b~0#1.offset|))))))) (let ((.cse46 (store .cse47 .cse25 (+ (select (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse47 .cse25))))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse46))) (let ((.cse44 (store (select .cse45 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse43 (+ (select (select (store .cse45 |c_ULTIMATE.start_main_~b~0#1.base| .cse44) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse43 (select (store .cse44 .cse2 .cse43) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse32)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse10 .cse57))))) (let ((.cse52 (let ((.cse54 (let ((.cse55 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse56 .cse10 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse57))))) (store .cse54 .cse4 (+ (select (select (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse54 .cse4)))))) (let ((.cse51 (store .cse53 |c_ULTIMATE.start_main_~a~0#1.base| .cse52))) (let ((.cse50 (store (select .cse51 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse49 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~b~0#1.base| .cse50) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse49 (select (store .cse50 .cse2 .cse49) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (let ((.cse59 (store (select .cse48 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse58 (+ (select (select (store .cse48 |c_ULTIMATE.start_main_~b~0#1.base| .cse59) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse58 (select (store .cse59 .cse2 .cse58) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse63 (let ((.cse64 (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse32))) (store .cse64 .cse4 (+ (select .cse64 .cse4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse64) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse63))) (let ((.cse61 (store (select .cse62 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse60 (+ (select (select (store .cse62 |c_ULTIMATE.start_main_~b~0#1.base| .cse61) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse60 (select (store .cse61 .cse2 .cse60) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse72 (select .cse8 .cse25))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse72 .cse10))))) (let ((.cse68 (let ((.cse70 (let ((.cse71 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse71 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse9 .cse72 .cse10 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse70 .cse4 (+ (select .cse70 .cse4) (select (select (store .cse69 |c_ULTIMATE.start_main_~a~0#1.base| .cse70) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse67 (store .cse69 |c_ULTIMATE.start_main_~a~0#1.base| .cse68))) (let ((.cse66 (store (select .cse67 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse65 (+ (select (select (store .cse67 |c_ULTIMATE.start_main_~b~0#1.base| .cse66) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse65 (select (store .cse66 .cse2 .cse65) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (<= 2 c_~N~0) (let ((.cse85 (store .cse30 .cse25 1))) (let ((.cse83 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse85))) (let ((.cse84 (select .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse81 (select .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse82 (select .cse85 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse80 (select (select (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse77 (store .cse83 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse84 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse82))))) (let ((.cse76 (let ((.cse78 (let ((.cse79 (select .cse77 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse79 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse80 (select .cse79 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse81 .cse82))))) (store .cse78 .cse4 (+ (select (select (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| .cse78) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse78 .cse4)))))) (let ((.cse75 (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| .cse76))) (let ((.cse74 (store (select .cse75 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse76 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse73 (+ (select (select (store .cse75 |c_ULTIMATE.start_main_~b~0#1.base| .cse74) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse73 (select (store .cse74 .cse2 .cse73) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))))) (let ((.cse96 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse24))) (let ((.cse97 (select .cse96 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse93 (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse95 (select .cse97 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse94 (select (select (store .cse96 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse95))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse90 (store .cse96 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse97 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse93 .cse94 .cse95))))) (let ((.cse89 (let ((.cse91 (let ((.cse92 (select .cse90 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse92 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse93 .cse94 (select .cse92 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse95))))) (store .cse91 .cse4 (+ (select .cse91 .cse4) (select (select (store .cse90 |c_ULTIMATE.start_main_~a~0#1.base| .cse91) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse88 (store .cse90 |c_ULTIMATE.start_main_~a~0#1.base| .cse89))) (let ((.cse87 (store (select .cse88 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse89 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse86 (+ (select (select (store .cse88 |c_ULTIMATE.start_main_~b~0#1.base| .cse87) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse86 (select (store .cse87 .cse2 .cse86) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))))))) is different from true [2021-12-17 02:23:40,109 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse54 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (+ .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (select .cse20 .cse27)) (.cse10 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (+ .cse9 .cse10))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse28))) (.cse37 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse38 (+ .cse10 .cse37)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (.cse21 (+ .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (and (let ((.cse5 (let ((.cse7 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse9 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse10)))) (store .cse7 .cse4 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse4)))))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse1 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse0 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse0 (select (store .cse1 .cse2 .cse0) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse18 (select .cse20 .cse21))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse18))))) (let ((.cse14 (let ((.cse16 (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse10 .cse18))))) (store .cse16 .cse4 (+ (select (select (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse16 .cse4)))))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_main_~a~0#1.base| .cse14))) (let ((.cse12 (store (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse11 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse11 (select (store .cse12 .cse2 .cse11) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (let ((.cse25 (let ((.cse26 (store .cse20 .cse27 .cse28))) (store .cse26 .cse21 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse26 .cse21)))))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25))) (let ((.cse23 (store (select .cse24 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse22 (+ (select (select (store .cse24 |c_ULTIMATE.start_main_~b~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse22 (select (store .cse23 .cse2 .cse22) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse38)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse10 .cse37))))) (let ((.cse32 (let ((.cse34 (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse36 .cse10 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse37))))) (store .cse34 .cse4 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse34 .cse4)))))) (let ((.cse31 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse32))) (let ((.cse30 (store (select .cse31 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse29 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~b~0#1.base| .cse30) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse29 (select (store .cse30 .cse2 .cse29) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (let ((.cse42 (let ((.cse43 (store .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38))) (store .cse43 .cse4 (+ (select .cse43 .cse4) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42))) (let ((.cse40 (store (select .cse41 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse39 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~b~0#1.base| .cse40) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse39 (select (store .cse40 .cse2 .cse39) |c_ULTIMATE.start_main_~b~0#1.offset|)))))) (let ((.cse51 (select .cse8 .cse21))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse51 .cse10))))) (let ((.cse47 (let ((.cse49 (let ((.cse50 (select .cse48 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse50 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse9 .cse51 .cse10 (select .cse50 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse49 .cse4 (+ (select .cse49 .cse4) (select (select (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse49) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse46 (store .cse48 |c_ULTIMATE.start_main_~a~0#1.base| .cse47))) (let ((.cse45 (store (select .cse46 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (let ((.cse44 (+ (select (select (store .cse46 |c_ULTIMATE.start_main_~b~0#1.base| .cse45) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1))) (= .cse44 (select (store .cse45 .cse2 .cse44) |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) (let ((.cse52 (let ((.cse53 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse54) (+ .cse9 1)))) (store .cse53 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse54 8) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse53) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 1))))) (= (select .cse52 .cse2) (select .cse52 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))) is different from true [2021-12-17 02:23:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:23:40,270 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-12-17 02:23:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-12-17 02:23:40,271 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-17 02:23:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:23:40,272 INFO L225 Difference]: With dead ends: 100 [2021-12-17 02:23:40,272 INFO L226 Difference]: Without dead ends: 73 [2021-12-17 02:23:40,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2892 ImplicationChecksByTransitivity, 71.4s TimeCoverageRelationStatistics Valid=883, Invalid=9226, Unknown=7, NotChecked=804, Total=10920 [2021-12-17 02:23:40,275 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 59 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:23:40,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 230 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 793 Invalid, 0 Unknown, 140 Unchecked, 8.1s Time] [2021-12-17 02:23:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-17 02:23:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 43. [2021-12-17 02:23:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:23:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2021-12-17 02:23:40,279 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 36 [2021-12-17 02:23:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:23:40,279 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2021-12-17 02:23:40,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 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) [2021-12-17 02:23:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2021-12-17 02:23:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 02:23:40,280 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:23:40,280 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:23:40,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 02:23:40,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:23:40,498 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:23:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:23:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2021-12-17 02:23:40,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:23:40,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074132082] [2021-12-17 02:23:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:23:40,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:23:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:23:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:23:41,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:23:41,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074132082] [2021-12-17 02:23:41,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074132082] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:23:41,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403422916] [2021-12-17 02:23:41,823 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-17 02:23:41,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:23:41,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:23:41,824 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:23:41,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 02:23:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:23:41,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-17 02:23:41,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:23:41,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-17 02:23:41,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 02:23:41,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:23:42,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-17 02:23:42,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-12-17 02:23:42,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:23:42,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2021-12-17 02:23:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:23:42,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2021-12-17 02:23:42,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:23:42,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2021-12-17 02:23:42,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:23:42,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:42,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 55 [2021-12-17 02:23:43,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:43,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:43,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:43,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:43,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:43,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:23:43,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2021-12-17 02:23:43,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:43,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:43,203 INFO L354 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-12-17 02:23:43,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 56 [2021-12-17 02:23:43,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:23:43,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:23:43,429 INFO L354 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2021-12-17 02:23:43,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 54 [2021-12-17 02:23:43,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:43,753 INFO L354 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2021-12-17 02:23:43,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2021-12-17 02:23:44,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:23:44,067 INFO L354 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2021-12-17 02:23:44,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 64 [2021-12-17 02:23:44,603 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:23:44,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2021-12-17 02:23:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:23:44,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:23:46,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_519 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-12-17 02:24:06,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)))))) is different from false [2021-12-17 02:24:08,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (= (select (store (store (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse0) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)) (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)))) is different from false [2021-12-17 02:24:11,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| 1) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (= (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 8)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)))))) is different from false [2021-12-17 02:25:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 27 refuted. 1 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-17 02:25:44,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403422916] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:25:44,811 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:25:44,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 28, 30] total 80 [2021-12-17 02:25:44,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995754852] [2021-12-17 02:25:44,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:25:44,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2021-12-17 02:25:44,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:25:44,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-12-17 02:25:44,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=5186, Unknown=80, NotChecked=604, Total=6320 [2021-12-17 02:25:44,822 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 80 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 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) [2021-12-17 02:25:47,268 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (+ c_~N~0 1)) (.cse0 (select .cse3 0))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8)))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) (<= (+ (div (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 8) 3) c_~N~0) (<= .cse0 .cse1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| 1) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (= (select (store (store (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 8)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)))))) (<= 3 c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_137| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_137| 2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_137| 8))) 1) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_137| 1)))) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (= (select .cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 4) (= |c_ULTIMATE.start_main_~i~0#1| 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2021-12-17 02:25:49,350 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~N~0 1)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse0 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse0 1)) (= .cse0 3) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))) (<= (+ (div (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 8) 3) c_~N~0) (<= .cse1 .cse2) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse2 .cse1) (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| 1) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (= (select (store (store (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 8)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)))))) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (select (store (store (let ((.cse4 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_510) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 8)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)) (< |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (< |v_ULTIMATE.start_main_~i~0#1_147| 1) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)))) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (<= c_~N~0 3) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 02:25:59,535 WARN L227 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 76 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:26:01,538 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~N~0 1)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0))) (and (<= (+ (div (* |c_ULTIMATE.start_main_~a~0#1.offset| (- 1)) 8) 3) c_~N~0) (<= .cse0 .cse1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| 1) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (= (select (store (store (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 8)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (v_ArrVal_510 Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (= (select (store (store (let ((.cse3 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) v_ArrVal_510) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 8)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)) (< |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (< |v_ULTIMATE.start_main_~i~0#1_147| 1) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)))) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2021-12-17 02:26:43,203 WARN L227 SmtUtils]: Spent 24.15s on a formula simplification. DAG size of input: 65 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 02:26:45,206 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))))) (and (= .cse0 (+ c_~N~0 2)) (= .cse0 5) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 3 c_~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~a~0#1.base| Int)) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3)) (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (or (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|) (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) .cse1) 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse1))))) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))) (<= c_~N~0 3))) is different from false [2021-12-17 02:26:47,210 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (= (select (store (store (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)) (< |v_ULTIMATE.start_main_~i~0#1_147| 1) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| 1) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (= (select (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 8)) v_ArrVal_512))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (<= (+ |c_ULTIMATE.start_main_~i~0#1| 3) c_~N~0) (let ((.cse2 (+ c_~N~0 1)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) 0))) (and (<= .cse1 .cse2) (<= .cse2 .cse1)))) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) is different from false [2021-12-17 02:26:52,100 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_519 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select .cse0 0) (+ c_~N~0 2)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (<= 3 c_~N~0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~a~0#1.base| Int)) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 3)) (= |ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (or (= (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~#sum~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))) (= (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) 5) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (<= (+ (div (* |c_ULTIMATE.start_main_~b~0#1.offset| (- 1)) 8) 1) |c_ULTIMATE.start_main_~i~0#1|) (<= c_~N~0 3) (<= 1 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2021-12-17 02:26:54,104 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))) (+ c_~N~0 2)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_147| 8)) v_ArrVal_516) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0)) is different from false [2021-12-17 02:26:56,196 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_519 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) 0) (+ c_~N~0 2)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0) (<= (+ (div (* |c_ULTIMATE.start_main_~b~0#1.offset| (- 1)) 8) 1) |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-12-17 02:26:58,202 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int)) (or (forall ((v_ArrVal_519 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_146| 8)) v_ArrVal_519) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) is different from false [2021-12-17 02:26:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:26:58,222 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2021-12-17 02:26:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-12-17 02:26:58,222 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-17 02:26:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:26:58,223 INFO L225 Difference]: With dead ends: 104 [2021-12-17 02:26:58,223 INFO L226 Difference]: Without dead ends: 102 [2021-12-17 02:26:58,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 98 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 3066 ImplicationChecksByTransitivity, 190.9s TimeCoverageRelationStatistics Valid=620, Invalid=6809, Unknown=105, NotChecked=2366, Total=9900 [2021-12-17 02:26:58,225 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 525 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 02:26:58,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 228 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 143 Invalid, 0 Unknown, 525 Unchecked, 0.1s Time] [2021-12-17 02:26:58,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-17 02:26:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2021-12-17 02:26:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 85 states have internal predecessors, (98), 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) [2021-12-17 02:26:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2021-12-17 02:26:58,239 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 40 [2021-12-17 02:26:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:26:58,240 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2021-12-17 02:26:58,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 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) [2021-12-17 02:26:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2021-12-17 02:26:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 02:26:58,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:26:58,244 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:26:58,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 02:26:58,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-17 02:26:58,459 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:26:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:26:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1012369648, now seen corresponding path program 8 times [2021-12-17 02:26:58,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:26:58,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068916234] [2021-12-17 02:26:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:26:58,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:26:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:26:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:26:58,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:26:58,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068916234] [2021-12-17 02:26:58,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068916234] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:26:58,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296365821] [2021-12-17 02:26:58,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:26:58,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:26:58,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:26:58,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:26:58,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 02:26:58,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:26:58,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:26:58,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 02:26:58,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:26:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:26:58,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:26:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:26:58,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296365821] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:26:58,795 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:26:58,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 02:26:58,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811928977] [2021-12-17 02:26:58,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:26:58,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 02:26:58,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:26:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 02:26:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:26:58,796 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:26:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:26:58,998 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2021-12-17 02:26:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 02:26:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-17 02:26:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:26:58,999 INFO L225 Difference]: With dead ends: 188 [2021-12-17 02:26:59,000 INFO L226 Difference]: Without dead ends: 141 [2021-12-17 02:26:59,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-17 02:26:59,000 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 179 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:26:59,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 113 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:26:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-17 02:26:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2021-12-17 02:26:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.1057692307692308) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:26:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2021-12-17 02:26:59,008 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 42 [2021-12-17 02:26:59,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:26:59,009 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2021-12-17 02:26:59,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:26:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2021-12-17 02:26:59,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 02:26:59,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:26:59,010 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:26:59,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-17 02:26:59,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:26:59,228 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:26:59,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:26:59,228 INFO L85 PathProgramCache]: Analyzing trace with hash -308361392, now seen corresponding path program 9 times [2021-12-17 02:26:59,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:26:59,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82201661] [2021-12-17 02:26:59,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:26:59,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:26:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:26:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:26:59,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:26:59,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82201661] [2021-12-17 02:26:59,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82201661] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:26:59,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992068095] [2021-12-17 02:26:59,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 02:26:59,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:26:59,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:26:59,316 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:26:59,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-17 02:26:59,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-17 02:26:59,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:26:59,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 02:26:59,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:26:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:26:59,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:26:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-17 02:26:59,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992068095] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 02:26:59,673 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 02:26:59,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-17 02:26:59,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252354572] [2021-12-17 02:26:59,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 02:26:59,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 02:26:59,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 02:26:59,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 02:26:59,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-17 02:26:59,674 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:26:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 02:26:59,944 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2021-12-17 02:26:59,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 02:26:59,944 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-17 02:26:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 02:26:59,945 INFO L225 Difference]: With dead ends: 146 [2021-12-17 02:26:59,945 INFO L226 Difference]: Without dead ends: 117 [2021-12-17 02:26:59,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-17 02:26:59,946 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 136 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 02:26:59,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 151 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-17 02:26:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-17 02:26:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 86. [2021-12-17 02:26:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:26:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-17 02:26:59,952 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 42 [2021-12-17 02:26:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 02:26:59,952 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-17 02:26:59,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 02:26:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-17 02:26:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 02:26:59,953 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 02:26:59,953 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 02:26:59,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-17 02:27:00,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 02:27:00,164 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 02:27:00,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 02:27:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2112995272, now seen corresponding path program 2 times [2021-12-17 02:27:00,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 02:27:00,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230658293] [2021-12-17 02:27:00,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 02:27:00,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 02:27:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 02:27:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 02:27:01,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 02:27:01,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230658293] [2021-12-17 02:27:01,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230658293] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 02:27:01,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972642552] [2021-12-17 02:27:01,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 02:27:01,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 02:27:01,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 02:27:01,866 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 02:27:01,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-17 02:27:01,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 02:27:01,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 02:27:01,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-17 02:27:01,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 02:27:01,958 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 02:27:01,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2021-12-17 02:27:02,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-17 02:27:02,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-17 02:27:02,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-17 02:27:02,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-17 02:27:02,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-17 02:27:02,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 02:27:02,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:27:02,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2021-12-17 02:27:02,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:27:02,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2021-12-17 02:27:02,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 45 [2021-12-17 02:27:02,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:27:02,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:02,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2021-12-17 02:27:03,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:03,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:27:03,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:03,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:27:03,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:27:03,151 INFO L354 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2021-12-17 02:27:03,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 66 [2021-12-17 02:27:03,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:03,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:03,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:03,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 02:27:03,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:27:03,378 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-12-17 02:27:03,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 67 [2021-12-17 02:27:04,185 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-12-17 02:27:04,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 39 [2021-12-17 02:27:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-17 02:27:04,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 02:27:43,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_762 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_219| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (let ((.cse0 (store (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse1) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|))))) is different from false [2021-12-17 02:27:43,885 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_762 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (let ((.cse0 (store (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse1 8) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|))) (< |v_ULTIMATE.start_main_~i~0#1_219| (+ |c_ULTIMATE.start_main_~i~0#1| 2)))) is different from false [2021-12-17 02:27:44,745 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_762 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_219| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (let ((.cse0 (store (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse2) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) (store .cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse2 8) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1)))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8)) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|))))) is different from false [2021-12-17 02:27:47,046 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_223| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_762 Int) (v_ArrVal_755 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_755))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1))))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< |v_ULTIMATE.start_main_~i~0#1_219| 2))))) is different from false [2021-12-17 02:27:48,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (v_ArrVal_762 Int) (v_ArrVal_755 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_223| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_755))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1))))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< |v_ULTIMATE.start_main_~i~0#1_219| 2))) is different from false [2021-12-17 02:27:49,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (v_ArrVal_762 Int) (v_ArrVal_755 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_219| 2) (< |v_ULTIMATE.start_main_~i~0#1_223| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (store (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (store .cse5 .cse6 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse5 .cse6)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_755))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 1))))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) is different from false [2021-12-17 02:28:44,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (v_ArrVal_762 Int) (v_ArrVal_750 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_755 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_223| 2) (< |v_ULTIMATE.start_main_~i~0#1_219| 2) (let ((.cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_750)))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_750))))) (store .cse7 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_755))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)))))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) is different from false [2021-12-17 02:28:44,697 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:28:44,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1145 treesize of output 924 [2021-12-17 02:28:44,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (v_ArrVal_762 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_755 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_223| 2) (< |v_ULTIMATE.start_main_~i~0#1_219| 2) (let ((.cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse7 .cse4 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse4)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_755))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)))))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) is different from false [2021-12-17 02:28:45,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (v_ArrVal_762 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_745 Int) (v_ArrVal_755 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_223| 2) (let ((.cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_745)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (store .cse7 .cse4 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse7 .cse4)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_755))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)))))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< |v_ULTIMATE.start_main_~i~0#1_219| 2))) is different from false [2021-12-17 02:28:45,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_231| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_231| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (v_ArrVal_762 Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_745 Int) (v_ArrVal_755 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_223| 2) (let ((.cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_231| 8)) v_ArrVal_745)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse7 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_755))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)))))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< |v_ULTIMATE.start_main_~i~0#1_219| 2))))) is different from false [2021-12-17 02:28:45,468 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (v_ArrVal_762 Int) (|v_ULTIMATE.start_main_~i~0#1_231| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_745 Int) (v_ArrVal_755 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_223| 2) (let ((.cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_231| 8)) v_ArrVal_745)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse7 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_755))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)))))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< |v_ULTIMATE.start_main_~i~0#1_231| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< |v_ULTIMATE.start_main_~i~0#1_219| 2))) is different from false [2021-12-17 02:28:45,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_223| Int) (v_ArrVal_762 Int) (|v_ULTIMATE.start_main_~i~0#1_231| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_745 Int) (v_ArrVal_755 Int) (|v_ULTIMATE.start_main_~i~0#1_219| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_223| 2) (< |v_ULTIMATE.start_main_~i~0#1_231| (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~b~0#1.offset| 8))) (let ((.cse0 (store (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 8) |c_ULTIMATE.start_main_~a~0#1.offset| 8) 1) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_231| 8)) v_ArrVal_745)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse5 (store (let ((.cse7 (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (store .cse7 .cse4 (+ (select .cse7 .cse4) (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_223| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_755))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse5))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (store .cse2 .cse1 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)))))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_219| 8)) v_ArrVal_762))) (= (select .cse0 .cse1) (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (< |v_ULTIMATE.start_main_~i~0#1_219| 2))) is different from false [2021-12-17 02:28:45,720 INFO L354 Elim1Store]: treesize reduction 127, result has 23.0 percent of original size [2021-12-17 02:28:45,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 3029 treesize of output 1015 [2021-12-17 02:28:45,752 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:28:45,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10855 treesize of output 9931 [2021-12-17 02:28:45,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:28:45,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:28:45,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:28:45,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 02:28:45,820 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 02:28:45,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 13929 treesize of output 12021 Killed by 15