./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e19ca921 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/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ef2b56a2f4ebf2e6f7f4ededf8760f087ff726b08e36644d8dcb52a8d087cd1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 20:41:29,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 20:41:29,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 20:41:29,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 20:41:29,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 20:41:29,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 20:41:29,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 20:41:29,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 20:41:29,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 20:41:29,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 20:41:29,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 20:41:29,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 20:41:29,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 20:41:29,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 20:41:29,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 20:41:29,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 20:41:29,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 20:41:29,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 20:41:29,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 20:41:29,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 20:41:29,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 20:41:29,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 20:41:29,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 20:41:29,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 20:41:29,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 20:41:29,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 20:41:29,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 20:41:29,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 20:41:29,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 20:41:29,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 20:41:29,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 20:41:29,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 20:41:29,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 20:41:29,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 20:41:29,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 20:41:29,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 20:41:29,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 20:41:29,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 20:41:29,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 20:41:29,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 20:41:29,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 20:41:29,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-22 20:41:29,230 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 20:41:29,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 20:41:29,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 20:41:29,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 20:41:29,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 20:41:29,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 20:41:29,233 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 20:41:29,234 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 20:41:29,234 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 20:41:29,234 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 20:41:29,235 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 20:41:29,235 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 20:41:29,235 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 20:41:29,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 20:41:29,236 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 20:41:29,236 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 20:41:29,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 20:41:29,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 20:41:29,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 20:41:29,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 20:41:29,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 20:41:29,237 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 20:41:29,237 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 20:41:29,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 20:41:29,238 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 20:41:29,238 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 20:41:29,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 20:41:29,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 20:41:29,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 20:41:29,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 20:41:29,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 20:41:29,240 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 20:41:29,241 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 20:41:29,241 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> 6ef2b56a2f4ebf2e6f7f4ededf8760f087ff726b08e36644d8dcb52a8d087cd1 [2021-12-22 20:41:29,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 20:41:29,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 20:41:29,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 20:41:29,484 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 20:41:29,485 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 20:41:29,486 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c [2021-12-22 20:41:29,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772a9988d/48304ab64daa47debd15bf56a2cd1589/FLAG7dffe4eb0 [2021-12-22 20:41:29,922 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 20:41:29,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength6.c [2021-12-22 20:41:29,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772a9988d/48304ab64daa47debd15bf56a2cd1589/FLAG7dffe4eb0 [2021-12-22 20:41:30,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/772a9988d/48304ab64daa47debd15bf56a2cd1589 [2021-12-22 20:41:30,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 20:41:30,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 20:41:30,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 20:41:30,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 20:41:30,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 20:41:30,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58806cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30, skipping insertion in model container [2021-12-22 20:41:30,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 20:41:30,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 20:41:30,520 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:41:30,530 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 20:41:30,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:41:30,571 INFO L208 MainTranslator]: Completed translation [2021-12-22 20:41:30,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30 WrapperNode [2021-12-22 20:41:30,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 20:41:30,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 20:41:30,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 20:41:30,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 20:41:30,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,611 INFO L137 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2021-12-22 20:41:30,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 20:41:30,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 20:41:30,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 20:41:30,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 20:41:30,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 20:41:30,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 20:41:30,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 20:41:30,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 20:41:30,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (1/1) ... [2021-12-22 20:41:30,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:41:30,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:41:30,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-22 20:41:30,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-22 20:41:30,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 20:41:30,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 20:41:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 20:41:30,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 20:41:30,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 20:41:30,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 20:41:30,764 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 20:41:30,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 20:41:30,864 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 20:41:30,869 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 20:41:30,870 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-22 20:41:30,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:41:30 BoogieIcfgContainer [2021-12-22 20:41:30,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 20:41:30,873 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 20:41:30,873 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 20:41:30,876 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 20:41:30,877 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:41:30,877 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 08:41:30" (1/3) ... [2021-12-22 20:41:30,878 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f7231b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:41:30, skipping insertion in model container [2021-12-22 20:41:30,878 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:41:30,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:41:30" (2/3) ... [2021-12-22 20:41:30,879 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f7231b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:41:30, skipping insertion in model container [2021-12-22 20:41:30,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:41:30,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:41:30" (3/3) ... [2021-12-22 20:41:30,881 INFO L388 chiAutomizerObserver]: Analyzing ICFG ArraysOfVariableLength6.c [2021-12-22 20:41:30,935 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 20:41:30,935 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 20:41:30,935 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 20:41:30,935 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 20:41:30,935 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 20:41:30,935 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 20:41:30,936 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 20:41:30,936 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 20:41:30,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:41:30,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:41:30,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:41:30,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:41:30,975 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 20:41:30,975 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-22 20:41:30,976 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 20:41:30,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:41:30,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:41:30,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:41:30,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:41:30,979 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 20:41:30,979 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-12-22 20:41:30,984 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);havoc main_~c~0#1.base, main_~c~0#1.offset;main_~i~1#1 := 0; 8#L25-3true [2021-12-22 20:41:30,985 INFO L793 eck$LassoCheckResult]: Loop: 8#L25-3true assume !!(main_~i~1#1 % 4294967296 < 32);main_~c~0#1.base, main_~c~0#1.offset := main_~#mask~0#1.base, main_~#mask~0#1.offset;assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~c~0#1.base, main_~c~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 7#L15-3true assume !(foo_~i~0#1 < foo_~size#1); 12#L15-4true foo_#res#1 := foo_~i~0#1; 13#L18true main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 14#L25-2true main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8#L25-3true [2021-12-22 20:41:30,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-22 20:41:30,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:31,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017275817] [2021-12-22 20:41:31,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:31,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:31,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:41:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:31,172 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:41:31,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash 38364915, now seen corresponding path program 1 times [2021-12-22 20:41:31,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:31,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386823167] [2021-12-22 20:41:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:31,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:41:31,302 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-22 20:41:31,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:41:31,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386823167] [2021-12-22 20:41:31,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386823167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:41:31,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:41:31,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 20:41:31,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302910587] [2021-12-22 20:41:31,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:41:31,308 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:41:31,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:41:31,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:41:31,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:41:31,350 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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-22 20:41:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:41:31,370 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2021-12-22 20:41:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:41:31,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 22 transitions. [2021-12-22 20:41:31,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-22 20:41:31,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 16 transitions. [2021-12-22 20:41:31,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-22 20:41:31,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-22 20:41:31,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-12-22 20:41:31,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:41:31,388 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-22 20:41:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-12-22 20:41:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-12-22 20:41:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:41:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-22 20:41:31,410 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-22 20:41:31,411 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-22 20:41:31,411 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 20:41:31,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2021-12-22 20:41:31,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-22 20:41:31,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:41:31,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:41:31,414 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 20:41:31,414 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:41:31,414 INFO L791 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);havoc main_~c~0#1.base, main_~c~0#1.offset;main_~i~1#1 := 0; 48#L25-3 [2021-12-22 20:41:31,415 INFO L793 eck$LassoCheckResult]: Loop: 48#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);main_~c~0#1.base, main_~c~0#1.offset := main_~#mask~0#1.base, main_~#mask~0#1.offset;assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~c~0#1.base, main_~c~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 54#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 55#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 57#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 45#L15-4 foo_#res#1 := foo_~i~0#1; 46#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 47#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 48#L25-3 [2021-12-22 20:41:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-22 20:41:31,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:31,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960078256] [2021-12-22 20:41:31,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:31,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:31,435 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:41:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:31,447 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:41:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:31,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1732759051, now seen corresponding path program 1 times [2021-12-22 20:41:31,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:31,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166140982] [2021-12-22 20:41:31,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:31,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:41:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:41:31,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:41:31,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166140982] [2021-12-22 20:41:31,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166140982] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 20:41:31,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457586335] [2021-12-22 20:41:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:31,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:41:31,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:41:31,526 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-22 20:41:31,530 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-22 20:41:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:41:31,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-22 20:41:31,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:41:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:41:31,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 20:41:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:41:31,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457586335] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 20:41:31,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 20:41:31,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2021-12-22 20:41:31,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87425154] [2021-12-22 20:41:31,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 20:41:31,746 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:41:31,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:41:31,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 20:41:31,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-12-22 20:41:31,748 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:41:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:41:31,783 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-12-22 20:41:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 20:41:31,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2021-12-22 20:41:31,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-12-22 20:41:31,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2021-12-22 20:41:31,787 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-22 20:41:31,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-22 20:41:31,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2021-12-22 20:41:31,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:41:31,788 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-12-22 20:41:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2021-12-22 20:41:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-22 20:41:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 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-22 20:41:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2021-12-22 20:41:31,792 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-12-22 20:41:31,792 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2021-12-22 20:41:31,792 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 20:41:31,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2021-12-22 20:41:31,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-12-22 20:41:31,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:41:31,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:41:31,796 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 20:41:31,796 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1] [2021-12-22 20:41:31,796 INFO L791 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 129#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);havoc main_~c~0#1.base, main_~c~0#1.offset;main_~i~1#1 := 0; 127#L25-3 [2021-12-22 20:41:31,796 INFO L793 eck$LassoCheckResult]: Loop: 127#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);main_~c~0#1.base, main_~c~0#1.offset := main_~#mask~0#1.base, main_~#mask~0#1.offset;assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~c~0#1.base, main_~c~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 133#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 134#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 136#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 142#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 141#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 140#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 139#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 138#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 137#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 124#L15-4 foo_#res#1 := foo_~i~0#1; 125#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 126#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 127#L25-3 [2021-12-22 20:41:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-22 20:41:31,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:31,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687027792] [2021-12-22 20:41:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:31,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:31,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:41:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:31,833 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:41:31,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1316700165, now seen corresponding path program 2 times [2021-12-22 20:41:31,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:31,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280984790] [2021-12-22 20:41:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:31,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:41:31,992 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-22 20:41:31,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:41:31,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280984790] [2021-12-22 20:41:31,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280984790] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 20:41:31,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410721772] [2021-12-22 20:41:31,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 20:41:31,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:41:31,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:41:31,996 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-22 20:41:31,996 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-22 20:41:32,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 20:41:32,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 20:41:32,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 20:41:32,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:41:32,244 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-22 20:41:32,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 20:41:32,360 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-22 20:41:32,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410721772] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 20:41:32,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 20:41:32,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2021-12-22 20:41:32,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499334860] [2021-12-22 20:41:32,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 20:41:32,362 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:41:32,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:41:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-22 20:41:32,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2021-12-22 20:41:32,365 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:41:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:41:32,413 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2021-12-22 20:41:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 20:41:32,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2021-12-22 20:41:32,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-12-22 20:41:32,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2021-12-22 20:41:32,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2021-12-22 20:41:32,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2021-12-22 20:41:32,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2021-12-22 20:41:32,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:41:32,423 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-12-22 20:41:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2021-12-22 20:41:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-22 20:41:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:41:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2021-12-22 20:41:32,429 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-12-22 20:41:32,429 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-12-22 20:41:32,429 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 20:41:32,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2021-12-22 20:41:32,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2021-12-22 20:41:32,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:41:32,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:41:32,430 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 20:41:32,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 1, 1, 1, 1, 1] [2021-12-22 20:41:32,430 INFO L791 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);havoc main_~c~0#1.base, main_~c~0#1.offset;main_~i~1#1 := 0; 269#L25-3 [2021-12-22 20:41:32,431 INFO L793 eck$LassoCheckResult]: Loop: 269#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);main_~c~0#1.base, main_~c~0#1.offset := main_~#mask~0#1.base, main_~#mask~0#1.offset;assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~c~0#1.base, main_~c~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 278#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 279#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 275#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 276#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 296#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 295#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 294#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 293#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 292#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 291#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 290#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 289#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 288#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 287#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 286#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 285#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 284#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 283#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 282#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 281#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 280#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 266#L15-4 foo_#res#1 := foo_~i~0#1; 267#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 268#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 269#L25-3 [2021-12-22 20:41:32,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-22 20:41:32,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:32,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008670269] [2021-12-22 20:41:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:32,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:32,438 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:41:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:32,442 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:41:32,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:32,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2131617415, now seen corresponding path program 3 times [2021-12-22 20:41:32,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:32,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069296923] [2021-12-22 20:41:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:32,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:41:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:41:32,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:41:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069296923] [2021-12-22 20:41:32,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069296923] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 20:41:32,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459471328] [2021-12-22 20:41:32,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 20:41:32,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:41:32,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:41:32,652 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-22 20:41:32,653 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-22 20:41:32,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-22 20:41:32,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 20:41:32,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-22 20:41:32,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:41:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:41:33,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 20:41:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:41:33,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459471328] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 20:41:33,502 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 20:41:33,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2021-12-22 20:41:33,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859047067] [2021-12-22 20:41:33,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 20:41:33,503 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:41:33,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:41:33,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-22 20:41:33,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2021-12-22 20:41:33,505 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 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-22 20:41:33,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:41:33,595 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2021-12-22 20:41:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-22 20:41:33,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 57 transitions. [2021-12-22 20:41:33,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2021-12-22 20:41:33,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 57 transitions. [2021-12-22 20:41:33,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2021-12-22 20:41:33,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2021-12-22 20:41:33,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 57 transitions. [2021-12-22 20:41:33,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:41:33,603 INFO L681 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-12-22 20:41:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 57 transitions. [2021-12-22 20:41:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-22 20:41:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:41:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-12-22 20:41:33,610 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-12-22 20:41:33,610 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-12-22 20:41:33,610 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-22 20:41:33,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 57 transitions. [2021-12-22 20:41:33,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2021-12-22 20:41:33,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:41:33,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:41:33,617 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 20:41:33,617 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [22, 22, 1, 1, 1, 1, 1] [2021-12-22 20:41:33,617 INFO L791 eck$LassoCheckResult]: Stem: 538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 539#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);havoc main_~c~0#1.base, main_~c~0#1.offset;main_~i~1#1 := 0; 537#L25-3 [2021-12-22 20:41:33,618 INFO L793 eck$LassoCheckResult]: Loop: 537#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);main_~c~0#1.base, main_~c~0#1.offset := main_~#mask~0#1.base, main_~#mask~0#1.offset;assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~c~0#1.base, main_~c~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 546#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 547#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 543#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 544#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 588#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 587#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 586#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 585#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 584#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 583#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 582#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 581#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 580#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 579#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 578#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 577#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 576#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 575#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 574#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 573#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 572#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 571#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 570#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 569#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 568#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 567#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 566#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 565#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 564#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 563#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 562#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 561#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 560#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 559#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 558#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 557#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 556#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 555#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 554#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 553#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 552#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 551#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 550#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 549#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 548#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 534#L15-4 foo_#res#1 := foo_~i~0#1; 535#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 536#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 537#L25-3 [2021-12-22 20:41:33,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:33,618 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-22 20:41:33,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:33,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944478380] [2021-12-22 20:41:33,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:33,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:33,645 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:41:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:33,657 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:41:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:33,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1575559777, now seen corresponding path program 4 times [2021-12-22 20:41:33,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:33,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052071642] [2021-12-22 20:41:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:33,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:41:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:41:34,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:41:34,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052071642] [2021-12-22 20:41:34,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052071642] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 20:41:34,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694675695] [2021-12-22 20:41:34,198 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-22 20:41:34,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:41:34,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:41:34,203 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-22 20:41:34,221 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-22 20:41:34,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-22 20:41:34,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 20:41:34,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-22 20:41:34,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:41:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:41:35,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 20:41:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:41:36,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694675695] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 20:41:36,261 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 20:41:36,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2021-12-22 20:41:36,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905848418] [2021-12-22 20:41:36,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 20:41:36,263 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:41:36,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:41:36,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-12-22 20:41:36,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2050, Invalid=2920, Unknown=0, NotChecked=0, Total=4970 [2021-12-22 20:41:36,266 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. cyclomatic complexity: 4 Second operand has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 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-22 20:41:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:41:36,380 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2021-12-22 20:41:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-22 20:41:36,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 77 transitions. [2021-12-22 20:41:36,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2021-12-22 20:41:36,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 77 transitions. [2021-12-22 20:41:36,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2021-12-22 20:41:36,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2021-12-22 20:41:36,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 77 transitions. [2021-12-22 20:41:36,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:41:36,384 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-12-22 20:41:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 77 transitions. [2021-12-22 20:41:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-22 20:41:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 74 states have internal predecessors, (77), 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-22 20:41:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2021-12-22 20:41:36,387 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-12-22 20:41:36,388 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 77 transitions. [2021-12-22 20:41:36,388 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-22 20:41:36,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 77 transitions. [2021-12-22 20:41:36,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 72 [2021-12-22 20:41:36,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:41:36,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:41:36,389 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-22 20:41:36,389 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [32, 32, 1, 1, 1, 1, 1] [2021-12-22 20:41:36,389 INFO L791 eck$LassoCheckResult]: Stem: 1030#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1031#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~post4#1, main_~i~1#1, main_~#b~0#1.base, main_~#b~0#1.offset, main_~buffer~0#1, main_~#mask~0#1.base, main_~#mask~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;havoc main_~i~1#1;call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400);havoc main_~buffer~0#1;call main_~#mask~0#1.base, main_~#mask~0#1.offset := #Ultimate.allocOnStack(32);havoc main_~c~0#1.base, main_~c~0#1.offset;main_~i~1#1 := 0; 1028#L25-3 [2021-12-22 20:41:36,389 INFO L793 eck$LassoCheckResult]: Loop: 1028#L25-3 assume !!(main_~i~1#1 % 4294967296 < 32);main_~c~0#1.base, main_~c~0#1.offset := main_~#mask~0#1.base, main_~#mask~0#1.offset;assume { :begin_inline_foo } true;foo_#in~size#1, foo_#in~b#1.base, foo_#in~b#1.offset := 32, main_~c~0#1.base, main_~c~0#1.offset;havoc foo_#res#1;havoc foo_#t~mem1#1, foo_#t~post0#1, foo_~size#1, foo_~b#1.base, foo_~b#1.offset, foo_~a~0#1, foo_~i~0#1;foo_~size#1 := foo_#in~size#1;foo_~b#1.base, foo_~b#1.offset := foo_#in~b#1.base, foo_#in~b#1.offset;havoc foo_~a~0#1;havoc foo_~i~0#1;foo_~i~0#1 := 0; 1038#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1039#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1035#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1036#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1100#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1099#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1098#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1097#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1096#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1095#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1094#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1093#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1092#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1091#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1090#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1089#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1088#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1087#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1086#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1085#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1084#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1083#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1082#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1081#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1080#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1079#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1078#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1077#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1076#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1075#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1074#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1073#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1072#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1071#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1070#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1069#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1068#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1067#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1066#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1065#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1064#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1063#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1062#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1061#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1060#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1059#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1058#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1057#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1056#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1055#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1054#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1053#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1052#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1051#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1050#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1049#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1048#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1047#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1046#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1045#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1044#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1043#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1042#L15-3 assume !!(foo_~i~0#1 < foo_~size#1);assume 0 <= foo_~i~0#1 && foo_~i~0#1 < 32;call foo_#t~mem1#1 := read~int(foo_~b#1.base, foo_~b#1.offset + foo_~i~0#1, 1);foo_~a~0#1 := foo_~a~0#1[foo_~i~0#1 := foo_#t~mem1#1];havoc foo_#t~mem1#1; 1041#L15-2 foo_#t~post0#1 := foo_~i~0#1;foo_~i~0#1 := 1 + foo_#t~post0#1;havoc foo_#t~post0#1; 1040#L15-3 assume !(foo_~i~0#1 < foo_~size#1); 1029#L15-4 foo_#res#1 := foo_~i~0#1; 1026#L18 main_#t~ret3#1 := foo_#res#1;assume { :end_inline_foo } true;call write~int(main_#t~ret3#1, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~ret3#1; 1027#L25-2 main_#t~post2#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1028#L25-3 [2021-12-22 20:41:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:36,390 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-22 20:41:36,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:36,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933441171] [2021-12-22 20:41:36,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:36,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:36,398 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:41:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:36,406 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:41:36,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash 776556339, now seen corresponding path program 5 times [2021-12-22 20:41:36,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:36,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540111820] [2021-12-22 20:41:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:36,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:36,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:41:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:36,545 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:41:36,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:41:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash -378248015, now seen corresponding path program 1 times [2021-12-22 20:41:36,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:41:36,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672311740] [2021-12-22 20:41:36,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:41:36,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:41:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:36,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:41:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:41:36,619 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:42:42,309 WARN L227 SmtUtils]: Spent 1.09m on a formula simplification. DAG size of input: 507 DAG size of output: 317 (called from [L 232] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-22 20:42:42,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:42,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 20:42:43,334 INFO L244 Elim1Store]: Index analysis took 935 ms [2021-12-22 20:42:43,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 496 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 429 [2021-12-22 20:42:44,324 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:42:44,325 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:42:44,325 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:42:44,325 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:42:44,325 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:42:44,325 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:42:44,325 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:42:44,325 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:42:44,325 INFO L133 ssoRankerPreferences]: Filename of dumped script: ArraysOfVariableLength6.c_Iteration6_Lasso [2021-12-22 20:42:44,325 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:42:44,325 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:42:44,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:42:44,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:42:44,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:42:44,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:42:44,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true