./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/interleave_bits.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 05:42:50,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 05:42:50,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 05:42:50,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 05:42:50,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 05:42:50,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 05:42:50,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 05:42:50,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 05:42:50,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 05:42:50,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 05:42:50,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 05:42:50,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 05:42:50,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 05:42:50,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 05:42:50,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 05:42:50,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 05:42:50,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 05:42:50,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 05:42:50,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 05:42:50,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 05:42:50,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 05:42:50,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 05:42:50,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 05:42:50,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 05:42:50,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 05:42:50,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 05:42:50,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 05:42:50,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 05:42:50,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 05:42:50,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 05:42:50,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 05:42:50,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 05:42:50,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 05:42:50,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 05:42:50,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 05:42:50,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 05:42:50,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 05:42:50,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 05:42:50,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 05:42:50,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 05:42:50,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 05:42:50,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 05:42:50,306 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 05:42:50,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 05:42:50,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 05:42:50,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 05:42:50,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 05:42:50,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 05:42:50,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 05:42:50,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 05:42:50,308 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 05:42:50,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 05:42:50,309 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 05:42:50,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 05:42:50,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 05:42:50,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 05:42:50,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 05:42:50,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 05:42:50,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 05:42:50,310 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 05:42:50,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 05:42:50,310 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 05:42:50,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 05:42:50,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 05:42:50,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 05:42:50,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 05:42:50,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:42:50,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 05:42:50,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 05:42:50,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 05:42:50,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 05:42:50,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 05:42:50,312 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 05:42:50,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 05:42:50,313 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 05:42:50,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 05:42:50,313 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 05:42:50,313 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2023-02-17 05:42:50,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 05:42:50,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 05:42:50,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 05:42:50,530 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 05:42:50,530 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 05:42:50,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2023-02-17 05:42:51,603 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 05:42:51,873 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 05:42:51,874 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2023-02-17 05:42:51,878 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d97f595/0080fc79cc5e4cc796d2706d5da745f6/FLAG52e655fd2 [2023-02-17 05:42:51,889 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d97f595/0080fc79cc5e4cc796d2706d5da745f6 [2023-02-17 05:42:51,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 05:42:51,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 05:42:51,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 05:42:51,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 05:42:51,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 05:42:51,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:42:51" (1/1) ... [2023-02-17 05:42:51,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fea577a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:51, skipping insertion in model container [2023-02-17 05:42:51,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:42:51" (1/1) ... [2023-02-17 05:42:51,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 05:42:51,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 05:42:52,023 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-02-17 05:42:52,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:42:52,073 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 05:42:52,081 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-02-17 05:42:52,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:42:52,106 INFO L208 MainTranslator]: Completed translation [2023-02-17 05:42:52,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52 WrapperNode [2023-02-17 05:42:52,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 05:42:52,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 05:42:52,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 05:42:52,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 05:42:52,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,160 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2023-02-17 05:42:52,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 05:42:52,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 05:42:52,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 05:42:52,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 05:42:52,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,201 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 05:42:52,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 05:42:52,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 05:42:52,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 05:42:52,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (1/1) ... [2023-02-17 05:42:52,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:42:52,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:42:52,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 05:42:52,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 05:42:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 05:42:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 05:42:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 05:42:52,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 05:42:52,321 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 05:42:52,323 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 05:42:52,547 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 05:42:52,551 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 05:42:52,551 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 05:42:52,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:42:52 BoogieIcfgContainer [2023-02-17 05:42:52,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 05:42:52,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 05:42:52,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 05:42:52,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 05:42:52,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 05:42:51" (1/3) ... [2023-02-17 05:42:52,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8a39ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:42:52, skipping insertion in model container [2023-02-17 05:42:52,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:52" (2/3) ... [2023-02-17 05:42:52,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8a39ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:42:52, skipping insertion in model container [2023-02-17 05:42:52,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:42:52" (3/3) ... [2023-02-17 05:42:52,558 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2023-02-17 05:42:52,570 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 05:42:52,570 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 05:42:52,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 05:42:52,619 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1318e940, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 05:42:52,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 05:42:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:52,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 05:42:52,638 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:52,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:52,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:52,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:52,643 INFO L85 PathProgramCache]: Analyzing trace with hash 943581884, now seen corresponding path program 1 times [2023-02-17 05:42:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:42:52,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710293834] [2023-02-17 05:42:52,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:42:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:52,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:42:52,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710293834] [2023-02-17 05:42:52,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710293834] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:42:52,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:42:52,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:42:52,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329044054] [2023-02-17 05:42:52,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:42:52,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:42:52,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:42:52,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:42:52,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:42:52,966 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:53,004 INFO L93 Difference]: Finished difference Result 74 states and 114 transitions. [2023-02-17 05:42:53,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:42:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-17 05:42:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:53,021 INFO L225 Difference]: With dead ends: 74 [2023-02-17 05:42:53,021 INFO L226 Difference]: Without dead ends: 35 [2023-02-17 05:42:53,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:42:53,026 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:53,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:42:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-17 05:42:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-17 05:42:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2023-02-17 05:42:53,055 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 24 [2023-02-17 05:42:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:53,056 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2023-02-17 05:42:53,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2023-02-17 05:42:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 05:42:53,057 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:53,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:53,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 05:42:53,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:53,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1235775969, now seen corresponding path program 1 times [2023-02-17 05:42:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:42:53,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004598846] [2023-02-17 05:42:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:53,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:42:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:53,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:42:53,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004598846] [2023-02-17 05:42:53,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004598846] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:42:53,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617282135] [2023-02-17 05:42:53,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:53,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:42:53,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:42:53,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:42:53,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 05:42:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:53,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 05:42:53,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:53,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:42:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:53,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617282135] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:42:53,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:42:53,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-17 05:42:53,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121506084] [2023-02-17 05:42:53,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:42:53,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 05:42:53,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:42:53,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 05:42:53,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:42:53,350 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:53,392 INFO L93 Difference]: Finished difference Result 69 states and 107 transitions. [2023-02-17 05:42:53,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 05:42:53,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-17 05:42:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:53,393 INFO L225 Difference]: With dead ends: 69 [2023-02-17 05:42:53,393 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 05:42:53,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-02-17 05:42:53,395 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:53,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:42:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 05:42:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-17 05:42:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2023-02-17 05:42:53,401 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 25 [2023-02-17 05:42:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:53,402 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2023-02-17 05:42:53,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2023-02-17 05:42:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 05:42:53,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:53,404 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:53,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 05:42:53,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:42:53,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2110190596, now seen corresponding path program 2 times [2023-02-17 05:42:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:42:53,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176617165] [2023-02-17 05:42:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:42:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:53,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:42:53,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176617165] [2023-02-17 05:42:53,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176617165] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:42:53,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863922207] [2023-02-17 05:42:53,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 05:42:53,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:42:53,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:42:53,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:42:53,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 05:42:53,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 05:42:53,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:42:53,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 05:42:53,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:53,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:42:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:54,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863922207] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:42:54,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:42:54,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-17 05:42:54,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698030291] [2023-02-17 05:42:54,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:42:54,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 05:42:54,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:42:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 05:42:54,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-02-17 05:42:54,033 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:54,144 INFO L93 Difference]: Finished difference Result 75 states and 116 transitions. [2023-02-17 05:42:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 05:42:54,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-17 05:42:54,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:54,145 INFO L225 Difference]: With dead ends: 75 [2023-02-17 05:42:54,145 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 05:42:54,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2023-02-17 05:42:54,147 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:54,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:42:54,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 05:42:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-17 05:42:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2023-02-17 05:42:54,155 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 28 [2023-02-17 05:42:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:54,155 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2023-02-17 05:42:54,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2023-02-17 05:42:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 05:42:54,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:54,157 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:54,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:54,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-02-17 05:42:54,367 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:54,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:54,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1506553380, now seen corresponding path program 3 times [2023-02-17 05:42:54,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:42:54,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691786296] [2023-02-17 05:42:54,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:54,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:42:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:42:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:54,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 05:42:54,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691786296] [2023-02-17 05:42:54,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691786296] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 05:42:54,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430889455] [2023-02-17 05:42:54,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 05:42:54,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:42:54,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:42:54,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 05:42:54,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 05:42:54,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-17 05:42:54,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:42:54,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 05:42:54,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:42:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:54,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:42:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:42:55,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430889455] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:42:55,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 05:42:55,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-02-17 05:42:55,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030485884] [2023-02-17 05:42:55,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 05:42:55,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 05:42:55,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 05:42:55,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 05:42:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2023-02-17 05:42:55,116 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:42:55,408 INFO L93 Difference]: Finished difference Result 81 states and 122 transitions. [2023-02-17 05:42:55,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 05:42:55,409 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-17 05:42:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:42:55,409 INFO L225 Difference]: With dead ends: 81 [2023-02-17 05:42:55,409 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 05:42:55,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 10 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2023-02-17 05:42:55,411 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:42:55,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:42:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 05:42:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-02-17 05:42:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2023-02-17 05:42:55,416 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 34 [2023-02-17 05:42:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:42:55,416 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2023-02-17 05:42:55,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:42:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2023-02-17 05:42:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-17 05:42:55,417 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:42:55,417 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:42:55,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 05:42:55,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 05:42:55,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:42:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:42:55,651 INFO L85 PathProgramCache]: Analyzing trace with hash -608522308, now seen corresponding path program 4 times [2023-02-17 05:42:55,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 05:42:55,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933602680] [2023-02-17 05:42:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:42:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 05:42:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 05:42:55,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 05:42:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 05:42:55,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 05:42:55,838 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 05:42:55,839 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 05:42:55,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 05:42:55,843 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-02-17 05:42:55,845 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 05:42:55,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 05:42:55 BoogieIcfgContainer [2023-02-17 05:42:55,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 05:42:55,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 05:42:55,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 05:42:55,878 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 05:42:55,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:42:52" (3/4) ... [2023-02-17 05:42:55,881 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-17 05:42:55,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 05:42:55,882 INFO L158 Benchmark]: Toolchain (without parser) took 3989.32ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 111.1MB in the beginning and 135.8MB in the end (delta: -24.7MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2023-02-17 05:42:55,882 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:42:55,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.79ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 100.2MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 05:42:55,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.36ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 96.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 05:42:55,883 INFO L158 Benchmark]: Boogie Preprocessor took 40.80ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:42:55,883 INFO L158 Benchmark]: RCFGBuilder took 348.00ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 75.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-17 05:42:55,883 INFO L158 Benchmark]: TraceAbstraction took 3323.14ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 74.9MB in the beginning and 135.8MB in the end (delta: -60.9MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2023-02-17 05:42:55,883 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 178.3MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:42:55,885 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.79ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 100.2MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.36ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 96.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.80ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 94.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 348.00ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 75.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3323.14ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 74.9MB in the beginning and 135.8MB in the end (delta: -60.9MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 178.3MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 62. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15, z=3] [L49] COND TRUE i < sizeof(x) * 8 [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16, z=3] [L49] COND FALSE !(i < sizeof(x) * 8) VAL [i=16, z=3] [L53] xx = x [L54] yy = y VAL [i=16, x=0, xx=0, y=4, yy=4, z=3] [L55] xx = (xx | (xx << 8u)) & 16711935U VAL [i=16, x=0, xx=0, y=4, yy=4, z=3] [L56] xx = (xx | (xx << 4u)) & 252645135U VAL [i=16, x=0, xx=0, y=4, yy=4, z=3] [L57] xx = (xx | (xx << 2u)) & 858993459U VAL [i=16, x=0, xx=0, y=4, yy=4, z=3] [L58] xx = (xx | (xx << 1u)) & 1431655765U VAL [i=16, x=0, xx=0, y=4, yy=4, z=3] [L59] yy = (yy | (yy << 8u)) & 16711935U VAL [i=16, x=0, xx=0, y=4, yy=0, z=3] [L60] yy = (yy | (yy << 4u)) & 252645135U VAL [i=16, x=0, xx=0, y=4, yy=0, z=3] [L61] yy = (yy | (yy << 2u)) & 858993459U VAL [i=16, x=0, xx=0, y=4, yy=0, z=3] [L62] yy = (yy | (yy << 1u)) & 1431655765U VAL [i=16, x=0, xx=0, y=4, yy=0, z=3] [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 1339 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1131 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 198 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 208 mSDtfsCounter, 198 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 139 SyntacticMatches, 16 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 686 SizeOfPredicates, 3 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 0/198 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-17 05:42:55,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 05:42:57,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 05:42:57,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 05:42:57,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 05:42:57,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 05:42:57,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 05:42:57,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 05:42:57,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 05:42:57,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 05:42:58,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 05:42:58,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 05:42:58,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 05:42:58,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 05:42:58,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 05:42:58,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 05:42:58,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 05:42:58,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 05:42:58,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 05:42:58,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 05:42:58,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 05:42:58,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 05:42:58,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 05:42:58,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 05:42:58,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 05:42:58,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 05:42:58,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 05:42:58,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 05:42:58,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 05:42:58,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 05:42:58,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 05:42:58,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 05:42:58,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 05:42:58,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 05:42:58,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 05:42:58,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 05:42:58,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 05:42:58,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 05:42:58,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 05:42:58,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 05:42:58,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 05:42:58,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 05:42:58,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-17 05:42:58,073 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 05:42:58,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 05:42:58,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 05:42:58,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 05:42:58,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 05:42:58,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 05:42:58,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 05:42:58,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 05:42:58,075 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 05:42:58,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 05:42:58,075 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 05:42:58,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 05:42:58,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 05:42:58,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 05:42:58,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 05:42:58,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:42:58,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 05:42:58,077 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2023-02-17 05:42:58,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 05:42:58,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 05:42:58,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 05:42:58,386 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 05:42:58,387 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 05:42:58,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2023-02-17 05:42:59,610 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 05:42:59,790 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 05:42:59,791 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2023-02-17 05:42:59,795 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6077f62/ff7924d70fa443829282a6da1b0bc89f/FLAGc56dfd040 [2023-02-17 05:42:59,808 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d6077f62/ff7924d70fa443829282a6da1b0bc89f [2023-02-17 05:42:59,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 05:42:59,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 05:42:59,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 05:42:59,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 05:42:59,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 05:42:59,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:42:59" (1/1) ... [2023-02-17 05:42:59,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f4799b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:42:59, skipping insertion in model container [2023-02-17 05:42:59,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 05:42:59" (1/1) ... [2023-02-17 05:42:59,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 05:42:59,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 05:43:00,026 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-02-17 05:43:00,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:43:00,070 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 05:43:00,085 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i[1175,1188] [2023-02-17 05:43:00,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 05:43:00,111 INFO L208 MainTranslator]: Completed translation [2023-02-17 05:43:00,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00 WrapperNode [2023-02-17 05:43:00,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 05:43:00,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 05:43:00,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 05:43:00,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 05:43:00,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,178 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2023-02-17 05:43:00,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 05:43:00,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 05:43:00,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 05:43:00,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 05:43:00,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,213 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 05:43:00,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 05:43:00,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 05:43:00,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 05:43:00,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (1/1) ... [2023-02-17 05:43:00,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 05:43:00,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 05:43:00,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 05:43:00,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 05:43:00,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 05:43:00,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 05:43:00,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 05:43:00,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 05:43:00,337 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 05:43:00,339 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 05:43:00,488 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 05:43:00,493 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 05:43:00,509 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 05:43:00,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:43:00 BoogieIcfgContainer [2023-02-17 05:43:00,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 05:43:00,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 05:43:00,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 05:43:00,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 05:43:00,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 05:42:59" (1/3) ... [2023-02-17 05:43:00,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbaa7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:43:00, skipping insertion in model container [2023-02-17 05:43:00,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 05:43:00" (2/3) ... [2023-02-17 05:43:00,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbaa7b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 05:43:00, skipping insertion in model container [2023-02-17 05:43:00,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:43:00" (3/3) ... [2023-02-17 05:43:00,517 INFO L112 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2023-02-17 05:43:00,534 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 05:43:00,534 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 05:43:00,564 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 05:43:00,571 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@359622db, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 05:43:00,571 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 05:43:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 05:43:00,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:00,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 05:43:00,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:00,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:00,584 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2023-02-17 05:43:00,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:00,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756128554] [2023-02-17 05:43:00,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:00,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:00,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:00,621 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:00,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 05:43:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:00,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 05:43:00,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:00,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 05:43:00,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:00,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756128554] [2023-02-17 05:43:00,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756128554] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 05:43:00,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 05:43:00,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 05:43:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461801575] [2023-02-17 05:43:00,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 05:43:00,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 05:43:00,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:00,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 05:43:00,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:43:00,852 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:00,897 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2023-02-17 05:43:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 05:43:00,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-17 05:43:00,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:00,905 INFO L225 Difference]: With dead ends: 20 [2023-02-17 05:43:00,905 INFO L226 Difference]: Without dead ends: 8 [2023-02-17 05:43:00,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 05:43:00,910 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:00,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-02-17 05:43:00,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-17 05:43:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-02-17 05:43:00,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2023-02-17 05:43:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:00,934 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-02-17 05:43:00,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-02-17 05:43:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 05:43:00,935 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:00,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:00,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-17 05:43:01,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:01,142 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:01,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2023-02-17 05:43:01,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:01,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897626188] [2023-02-17 05:43:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 05:43:01,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:01,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:01,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:01,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 05:43:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 05:43:01,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 05:43:01,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:01,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:01,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:01,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897626188] [2023-02-17 05:43:01,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897626188] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:01,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:01,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-17 05:43:01,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295416848] [2023-02-17 05:43:01,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:01,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 05:43:01,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:01,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 05:43:01,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 05:43:01,239 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:01,267 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-02-17 05:43:01,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 05:43:01,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-17 05:43:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:01,269 INFO L225 Difference]: With dead ends: 15 [2023-02-17 05:43:01,272 INFO L226 Difference]: Without dead ends: 11 [2023-02-17 05:43:01,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-17 05:43:01,274 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:01,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-02-17 05:43:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-02-17 05:43:01,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-02-17 05:43:01,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-02-17 05:43:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:01,283 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-02-17 05:43:01,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-02-17 05:43:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 05:43:01,284 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:01,284 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:01,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:01,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:01,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2023-02-17 05:43:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:01,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170597207] [2023-02-17 05:43:01,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 05:43:01,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:01,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:01,495 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:01,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 05:43:01,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 05:43:01,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:43:01,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 05:43:01,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:01,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:01,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:01,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170597207] [2023-02-17 05:43:01,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170597207] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:01,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:01,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-17 05:43:01,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907574089] [2023-02-17 05:43:01,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:01,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 05:43:01,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:01,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 05:43:01,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-02-17 05:43:01,659 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:01,768 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-02-17 05:43:01,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 05:43:01,768 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-17 05:43:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:01,770 INFO L225 Difference]: With dead ends: 21 [2023-02-17 05:43:01,770 INFO L226 Difference]: Without dead ends: 17 [2023-02-17 05:43:01,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-02-17 05:43:01,773 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:01,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 05:43:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-17 05:43:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-02-17 05:43:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-02-17 05:43:01,781 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2023-02-17 05:43:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:01,781 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-02-17 05:43:01,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-02-17 05:43:01,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 05:43:01,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:01,782 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:01,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:01,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:01,984 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:01,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1628318539, now seen corresponding path program 3 times [2023-02-17 05:43:01,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:01,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710772893] [2023-02-17 05:43:01,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 05:43:01,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:01,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:01,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:01,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 05:43:02,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-17 05:43:02,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:43:02,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 05:43:02,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:02,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:02,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:02,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710772893] [2023-02-17 05:43:02,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710772893] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:02,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:02,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-02-17 05:43:02,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314026116] [2023-02-17 05:43:02,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:02,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 05:43:02,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:02,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 05:43:02,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2023-02-17 05:43:02,382 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:02,827 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-02-17 05:43:02,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 05:43:02,828 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-17 05:43:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:02,829 INFO L225 Difference]: With dead ends: 33 [2023-02-17 05:43:02,829 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 05:43:02,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 05:43:02,834 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:02,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 05:43:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 05:43:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-17 05:43:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-02-17 05:43:02,844 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 16 [2023-02-17 05:43:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:02,845 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-02-17 05:43:02,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-02-17 05:43:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 05:43:02,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 05:43:02,846 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1] [2023-02-17 05:43:02,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:03,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:03,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 05:43:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 05:43:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash 26919211, now seen corresponding path program 4 times [2023-02-17 05:43:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 05:43:03,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549009089] [2023-02-17 05:43:03,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 05:43:03,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:03,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 05:43:03,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 05:43:03,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 05:43:03,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 05:43:03,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 05:43:03,170 WARN L261 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-17 05:43:03,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 05:43:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 05:43:04,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 05:43:40,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ BitVec 16)) (|ULTIMATE.start_main_~y~0#1| (_ BitVec 16))) (let ((.cse0 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|)) (.cse2 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|))) (= (let ((.cse3 (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse5 (bvadd (_ bv1 32) .cse3))) (let ((.cse7 (bvadd (_ bv1 32) .cse5))) (let ((.cse9 (bvadd (_ bv1 32) .cse7))) (let ((.cse11 (bvadd (_ bv1 32) .cse9))) (let ((.cse13 (bvadd (_ bv1 32) .cse11))) (let ((.cse15 (bvadd (_ bv1 32) .cse13))) (let ((.cse17 (bvadd (_ bv1 32) .cse15))) (let ((.cse19 (bvadd (_ bv1 32) .cse17))) (let ((.cse21 (bvadd (_ bv1 32) .cse19))) (let ((.cse23 (bvadd (_ bv1 32) .cse21))) (let ((.cse25 (bvadd (_ bv1 32) .cse23))) (let ((.cse27 (bvadd (_ bv1 32) .cse25))) (let ((.cse29 (bvadd (_ bv1 32) .cse27))) (let ((.cse31 (bvadd (_ bv1 32) .cse29))) (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor (bvor |c_ULTIMATE.start_main_~z~0#1| (let ((.cse1 (bvshl (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (bvor (bvshl (bvand .cse0 .cse1) |c_ULTIMATE.start_main_~i~0#1|) (bvshl (bvand .cse2 .cse1) .cse3)))) (let ((.cse4 (bvshl (_ bv1 32) .cse3))) (bvor (bvshl (bvand .cse0 .cse4) .cse3) (bvshl (bvand .cse2 .cse4) .cse5)))) (let ((.cse6 (bvshl (_ bv1 32) .cse5))) (bvor (bvshl (bvand .cse0 .cse6) .cse5) (bvshl (bvand .cse2 .cse6) .cse7)))) (let ((.cse8 (bvshl (_ bv1 32) .cse7))) (bvor (bvshl (bvand .cse0 .cse8) .cse7) (bvshl (bvand .cse2 .cse8) .cse9)))) (let ((.cse10 (bvshl (_ bv1 32) .cse9))) (bvor (bvshl (bvand .cse0 .cse10) .cse9) (bvshl (bvand .cse2 .cse10) .cse11)))) (let ((.cse12 (bvshl (_ bv1 32) .cse11))) (bvor (bvshl (bvand .cse0 .cse12) .cse11) (bvshl (bvand .cse2 .cse12) .cse13)))) (let ((.cse14 (bvshl (_ bv1 32) .cse13))) (bvor (bvshl (bvand .cse0 .cse14) .cse13) (bvshl (bvand .cse2 .cse14) .cse15)))) (let ((.cse16 (bvshl (_ bv1 32) .cse15))) (bvor (bvshl (bvand .cse0 .cse16) .cse15) (bvshl (bvand .cse2 .cse16) .cse17)))) (let ((.cse18 (bvshl (_ bv1 32) .cse17))) (bvor (bvshl (bvand .cse0 .cse18) .cse17) (bvshl (bvand .cse2 .cse18) .cse19)))) (let ((.cse20 (bvshl (_ bv1 32) .cse19))) (bvor (bvshl (bvand .cse0 .cse20) .cse19) (bvshl (bvand .cse2 .cse20) .cse21)))) (let ((.cse22 (bvshl (_ bv1 32) .cse21))) (bvor (bvshl (bvand .cse0 .cse22) .cse21) (bvshl (bvand .cse2 .cse22) .cse23)))) (let ((.cse24 (bvshl (_ bv1 32) .cse23))) (bvor (bvshl (bvand .cse0 .cse24) .cse23) (bvshl (bvand .cse2 .cse24) .cse25)))) (let ((.cse26 (bvshl (_ bv1 32) .cse25))) (bvor (bvshl (bvand .cse0 .cse26) .cse25) (bvshl (bvand .cse2 .cse26) .cse27)))) (let ((.cse28 (bvshl (_ bv1 32) .cse27))) (bvor (bvshl (bvand .cse0 .cse28) .cse27) (bvshl (bvand .cse2 .cse28) .cse29)))) (let ((.cse30 (bvshl (_ bv1 32) .cse29))) (bvor (bvshl (bvand .cse0 .cse30) .cse29) (bvshl (bvand .cse2 .cse30) .cse31)))) (let ((.cse32 (bvshl (_ bv1 32) .cse31))) (bvor (bvshl (bvand .cse0 .cse32) .cse31) (bvshl (bvand .cse2 .cse32) (bvadd (_ bv1 32) .cse31)))))))))))))))))))) (let ((.cse53 (bvadd (_ bv1 32) (_ bv13 32)))) (let ((.cse55 (bvadd (_ bv1 32) .cse53))) (bvor (bvor (bvor (bvor (bvor (bvor (let ((.cse45 (bvadd (_ bv1 32) (_ bv7 32)))) (let ((.cse47 (bvadd (_ bv1 32) .cse45))) (bvor (bvor (bvor (let ((.cse43 (bvadd (_ bv7 32) (_ bv4294967295 32)))) (bvor (bvor (let ((.cse33 (bvadd (_ bv1 32) (_ bv0 32)))) (let ((.cse35 (bvadd (_ bv1 32) .cse33))) (let ((.cse37 (bvadd (_ bv1 32) .cse35))) (let ((.cse39 (bvadd (_ bv1 32) .cse37))) (bvor (bvor (bvor (bvor (bvor (_ bv0 32) (bvor (bvshl (bvand .cse0 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse2 (_ bv1 32)) .cse33))) (let ((.cse34 (bvshl (_ bv1 32) .cse33))) (bvor (bvshl (bvand .cse0 .cse34) .cse33) (bvshl (bvand .cse2 .cse34) .cse35)))) (let ((.cse36 (bvshl (_ bv1 32) .cse35))) (bvor (bvshl (bvand .cse0 .cse36) .cse35) (bvshl (bvand .cse2 .cse36) .cse37)))) (let ((.cse38 (bvshl (_ bv1 32) .cse37))) (bvor (bvshl (bvand .cse0 .cse38) .cse37) (bvshl (bvand .cse2 .cse38) .cse39)))) (let ((.cse40 (bvshl (_ bv1 32) .cse39))) (bvor (bvshl (bvand .cse0 .cse40) .cse39) (bvshl (bvand .cse2 .cse40) (bvadd (_ bv1 32) .cse39))))))))) (let ((.cse42 (bvadd .cse43 (_ bv4294967295 32)))) (let ((.cse41 (bvshl (_ bv1 32) .cse42))) (bvor (bvshl (bvand .cse0 .cse41) .cse42) (bvshl (bvand .cse2 .cse41) (bvadd (_ bv1 32) .cse42)))))) (let ((.cse44 (bvshl (_ bv1 32) .cse43))) (bvor (bvshl (bvand .cse0 .cse44) .cse43) (bvshl (bvand .cse2 .cse44) (bvadd (_ bv1 32) .cse43)))))) (bvor (bvshl (bvand .cse0 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse2 (_ bv128 32)) .cse45))) (let ((.cse46 (bvshl (_ bv1 32) .cse45))) (bvor (bvshl (bvand .cse0 .cse46) .cse45) (bvshl (bvand .cse2 .cse46) .cse47)))) (let ((.cse48 (bvshl (_ bv1 32) .cse47))) (bvor (bvshl (bvand .cse0 .cse48) .cse47) (bvshl (bvand .cse2 .cse48) (bvadd (_ bv1 32) .cse47))))))) (let ((.cse50 (bvadd (_ bv11 32) (_ bv4294967295 32)))) (let ((.cse49 (bvshl (_ bv1 32) .cse50))) (bvor (bvshl (bvand .cse0 .cse49) .cse50) (bvshl (bvand .cse2 .cse49) (bvadd (_ bv1 32) .cse50)))))) (bvor (bvshl (bvand .cse0 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse2 (_ bv2048 32)) (bvadd (_ bv1 32) (_ bv11 32))))) (let ((.cse52 (bvadd (_ bv13 32) (_ bv4294967295 32)))) (let ((.cse51 (bvshl (_ bv1 32) .cse52))) (bvor (bvshl (bvand .cse0 .cse51) .cse52) (bvshl (bvand .cse2 .cse51) (bvadd (_ bv1 32) .cse52)))))) (bvor (bvshl (bvand .cse0 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse2 (_ bv8192 32)) .cse53))) (let ((.cse54 (bvshl (_ bv1 32) .cse53))) (bvor (bvshl (bvand .cse0 .cse54) .cse53) (bvshl (bvand .cse2 .cse54) .cse55)))) (let ((.cse56 (bvshl (_ bv1 32) .cse55))) (bvor (bvshl (bvand .cse0 .cse56) .cse55) (bvshl (bvand .cse2 .cse56) (bvadd (_ bv1 32) .cse55)))))))))) is different from false [2023-02-17 05:43:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-02-17 05:43:40,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 05:43:40,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549009089] [2023-02-17 05:43:40,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549009089] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 05:43:40,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 05:43:40,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2023-02-17 05:43:40,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239244778] [2023-02-17 05:43:40,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 05:43:40,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-17 05:43:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 05:43:40,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-17 05:43:40,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=951, Unknown=1, NotChecked=68, Total=1332 [2023-02-17 05:43:40,979 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 05:43:42,079 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2023-02-17 05:43:42,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 05:43:42,079 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-17 05:43:42,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 05:43:42,079 INFO L225 Difference]: With dead ends: 29 [2023-02-17 05:43:42,079 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 05:43:42,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=332, Invalid=1003, Unknown=1, NotChecked=70, Total=1406 [2023-02-17 05:43:42,080 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 05:43:42,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 19 Unchecked, 0.9s Time] [2023-02-17 05:43:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 05:43:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 05:43:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 05:43:42,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2023-02-17 05:43:42,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 05:43:42,081 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 05:43:42,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 05:43:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 05:43:42,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 05:43:42,083 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 05:43:42,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-17 05:43:42,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 05:43:42,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 05:43:42,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 05:43:42,312 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2023-02-17 05:43:42,313 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 05:43:42,313 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 67) no Hoare annotation was computed. [2023-02-17 05:43:42,313 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 05:43:42,313 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 05:43:42,313 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2023-02-17 05:43:42,313 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2023-02-17 05:43:42,314 INFO L902 garLoopResultBuilder]: At program point L24-2(lines 23 28) the Hoare annotation is: true [2023-02-17 05:43:42,314 INFO L895 garLoopResultBuilder]: At program point L49-2(lines 49 52) the Hoare annotation is: (let ((.cse14 ((_ zero_extend 16) |ULTIMATE.start_main_~x~0#1|)) (.cse17 ((_ zero_extend 16) |ULTIMATE.start_main_~y~0#1|)) (.cse39 (bvadd (_ bv1 32) (_ bv0 32)))) (let ((.cse46 (bvor (_ bv0 32) (bvor (bvshl (bvand .cse14 (_ bv1 32)) (_ bv0 32)) (bvshl (bvand .cse17 (_ bv1 32)) .cse39)))) (.cse41 (bvadd (_ bv1 32) .cse39))) (let ((.cse40 (bvor .cse46 (let ((.cse77 (bvshl (_ bv1 32) .cse39))) (bvor (bvshl (bvand .cse14 .cse77) .cse39) (bvshl (bvand .cse17 .cse77) .cse41))))) (.cse6 (bvadd (_ bv1 32) .cse41)) (.cse59 (bvadd (_ bv1 32) |ULTIMATE.start_main_~i~0#1|))) (let ((.cse62 (bvadd (_ bv1 32) .cse59)) (.cse4 (bvor .cse40 (let ((.cse76 (bvshl (_ bv1 32) .cse41))) (bvor (bvshl (bvand .cse14 .cse76) .cse41) (bvshl (bvand .cse17 .cse76) .cse6))))) (.cse3 (bvadd (_ bv1 32) .cse6))) (let ((.cse2 (bvor .cse4 (let ((.cse75 (bvshl (_ bv1 32) .cse6))) (bvor (bvshl (bvand .cse14 .cse75) .cse6) (bvshl (bvand .cse17 .cse75) .cse3))))) (.cse13 (bvadd (_ bv1 32) .cse3)) (.cse63 (bvadd (_ bv1 32) .cse62))) (let ((.cse60 (bvadd (_ bv1 32) .cse63)) (.cse7 (bvor .cse2 (let ((.cse74 (bvshl (_ bv1 32) .cse3))) (bvor (bvshl (bvand .cse14 .cse74) .cse3) (bvshl (bvand .cse17 .cse74) .cse13))))) (.cse42 (bvadd (_ bv1 32) (_ bv7 32)))) (let ((.cse43 (bvor (let ((.cse72 (bvadd (_ bv7 32) (_ bv4294967295 32)))) (bvor (bvor .cse7 (let ((.cse71 (bvadd .cse72 (_ bv4294967295 32)))) (let ((.cse70 (bvshl (_ bv1 32) .cse71))) (bvor (bvshl (bvand .cse14 .cse70) .cse71) (bvshl (bvand .cse17 .cse70) (bvadd (_ bv1 32) .cse71)))))) (let ((.cse73 (bvshl (_ bv1 32) .cse72))) (bvor (bvshl (bvand .cse14 .cse73) .cse72) (bvshl (bvand .cse17 .cse73) (bvadd (_ bv1 32) .cse72)))))) (bvor (bvshl (bvand .cse14 (_ bv128 32)) (_ bv7 32)) (bvshl (bvand .cse17 (_ bv128 32)) .cse42)))) (.cse21 (bvadd (_ bv1 32) .cse42)) (.cse61 (bvadd (_ bv1 32) .cse60))) (let ((.cse58 (bvadd (_ bv1 32) .cse61)) (.cse22 (bvor .cse43 (let ((.cse69 (bvshl (_ bv1 32) .cse42))) (bvor (bvshl (bvand .cse14 .cse69) .cse42) (bvshl (bvand .cse17 .cse69) .cse21))))) (.cse28 (bvadd (_ bv1 32) .cse21))) (let ((.cse29 (bvor .cse22 (let ((.cse68 (bvshl (_ bv1 32) .cse21))) (bvor (bvshl (bvand .cse14 .cse68) .cse21) (bvshl (bvand .cse17 .cse68) .cse28))))) (.cse45 (bvadd (_ bv1 32) (_ bv11 32))) (.cse57 (bvadd (_ bv1 32) .cse58))) (let ((.cse56 (bvadd (_ bv1 32) .cse57)) (.cse44 (bvor (bvor .cse29 (let ((.cse67 (bvadd (_ bv11 32) (_ bv4294967295 32)))) (let ((.cse66 (bvshl (_ bv1 32) .cse67))) (bvor (bvshl (bvand .cse14 .cse66) .cse67) (bvshl (bvand .cse17 .cse66) (bvadd (_ bv1 32) .cse67)))))) (bvor (bvshl (bvand .cse14 (_ bv2048 32)) (_ bv11 32)) (bvshl (bvand .cse17 (_ bv2048 32)) .cse45)))) (.cse38 (bvadd (_ bv1 32) (_ bv13 32)))) (let ((.cse37 (bvor (bvor .cse44 (let ((.cse65 (bvadd (_ bv13 32) (_ bv4294967295 32)))) (let ((.cse64 (bvshl (_ bv1 32) .cse65))) (bvor (bvshl (bvand .cse14 .cse64) .cse65) (bvshl (bvand .cse17 .cse64) (bvadd (_ bv1 32) .cse65)))))) (bvor (bvshl (bvand .cse14 (_ bv8192 32)) (_ bv13 32)) (bvshl (bvand .cse17 (_ bv8192 32)) .cse38)))) (.cse47 (bvadd (_ bv1 32) .cse38)) (.cse33 (bvadd (_ bv1 32) .cse56))) (let ((.cse8 (bvult .cse63 (_ bv16 32))) (.cse11 (bvult .cse62 (_ bv16 32))) (.cse49 (bvult .cse61 (_ bv16 32))) (.cse9 (bvult .cse60 (_ bv16 32))) (.cse34 (bvult .cse33 (_ bv16 32))) (.cse5 (bvult |ULTIMATE.start_main_~i~0#1| (_ bv16 32))) (.cse10 (bvult .cse59 (_ bv16 32))) (.cse50 (bvult .cse58 (_ bv16 32))) (.cse52 (bvult .cse57 (_ bv16 32))) (.cse51 (bvult .cse56 (_ bv16 32))) (.cse48 (bvor .cse37 (let ((.cse55 (bvshl (_ bv1 32) .cse38))) (bvor (bvshl (bvand .cse14 .cse55) .cse38) (bvshl (bvand .cse17 .cse55) .cse47))))) (.cse0 (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv4294967295 32)))) (let ((.cse1 (bvadd (_ bv1 32) (_ bv2 32))) (.cse20 (bvadd (_ bv1 32) (_ bv8 32))) (.cse16 (bvadd .cse0 (_ bv4294967295 32))) (.cse19 (bvadd (_ bv1 32) (_ bv6 32))) (.cse18 (let ((.cse54 (bvshl (_ bv1 32) .cse0))) (bvor (bvshl (bvand .cse14 .cse54) .cse0) (bvshl (bvand .cse17 .cse54) (bvadd (_ bv1 32) .cse0))))) (.cse12 (bvadd (_ bv1 32) (_ bv4 32))) (.cse35 (= |ULTIMATE.start_main_~z~0#1| (bvor .cse48 (let ((.cse53 (bvshl (_ bv1 32) .cse47))) (bvor (bvshl (bvand .cse14 .cse53) .cse47) (bvshl (bvand .cse17 .cse53) (bvadd (_ bv1 32) .cse47))))))) (.cse24 (or (not .cse52) .cse51)) (.cse25 (or (not .cse50) .cse52)) (.cse30 (or (not .cse5) .cse10)) (.cse32 (or .cse34 (not .cse51))) (.cse36 (or .cse49 (not .cse9))) (.cse23 (or .cse8 (not .cse11))) (.cse26 (or (not .cse49) .cse50)) (.cse27 (or (not .cse10) .cse11)) (.cse31 (or (not .cse8) .cse9))) (or (and (= .cse0 .cse1) (= |ULTIMATE.start_main_~z~0#1| .cse2) (= |ULTIMATE.start_main_~i~0#1| .cse3)) (and (= |ULTIMATE.start_main_~z~0#1| .cse4) (= |ULTIMATE.start_main_~i~0#1| .cse1) .cse5 (= |ULTIMATE.start_main_~i~0#1| .cse6)) (and (= |ULTIMATE.start_main_~z~0#1| .cse7) .cse8 .cse9 .cse10 .cse5 .cse11 (= |ULTIMATE.start_main_~i~0#1| .cse12) (= |ULTIMATE.start_main_~i~0#1| .cse13)) (and (= |ULTIMATE.start_main_~z~0#1| (bvor (bvor .cse7 (let ((.cse15 (bvshl (_ bv1 32) .cse16))) (bvor (bvshl (bvand .cse14 .cse15) .cse16) (bvshl (bvand .cse17 .cse15) (bvadd (_ bv1 32) .cse16))))) .cse18)) (= .cse16 .cse13) .cse10 (= |ULTIMATE.start_main_~i~0#1| .cse19) .cse5 .cse11) (and (= |ULTIMATE.start_main_~i~0#1| .cse20) (= |ULTIMATE.start_main_~i~0#1| .cse21) (= |ULTIMATE.start_main_~z~0#1| .cse22) .cse5) (and .cse23 .cse24 .cse25 .cse26 .cse27 (= .cse0 .cse28) (= |ULTIMATE.start_main_~z~0#1| (bvor .cse29 .cse18)) .cse5 .cse30 .cse31 .cse32 (or (bvult (bvadd (_ bv1 32) .cse33) (_ bv16 32)) (not .cse34))) (and .cse23 .cse27 .cse5 .cse30 .cse31 .cse35) (and .cse5 .cse35) (and .cse23 .cse27 .cse5 .cse30 .cse35) (and .cse36 .cse23 (= |ULTIMATE.start_main_~z~0#1| .cse37) .cse25 .cse26 .cse5 .cse30 .cse31 (= |ULTIMATE.start_main_~i~0#1| .cse38)) .cse35 (and (= |ULTIMATE.start_main_~i~0#1| .cse28) (bvult .cse0 (_ bv16 32)) (= .cse0 .cse20) (= |ULTIMATE.start_main_~z~0#1| .cse29)) (and (= .cse16 (_ bv0 32)) (= .cse0 .cse39) .cse10 .cse5 (= |ULTIMATE.start_main_~z~0#1| .cse40) (= |ULTIMATE.start_main_~i~0#1| .cse41)) (and (= |ULTIMATE.start_main_~i~0#1| .cse42) .cse10 .cse5 (= .cse0 .cse19) (= |ULTIMATE.start_main_~z~0#1| .cse43)) (and .cse27 .cse5 .cse30 .cse35) (and .cse36 .cse24 .cse25 .cse26 .cse27 (= |ULTIMATE.start_main_~z~0#1| (bvor .cse44 .cse18)) .cse5 .cse30 (= .cse0 .cse45) .cse31) (and (= .cse0 .cse13) .cse8 (= |ULTIMATE.start_main_~z~0#1| (bvor .cse7 .cse18)) .cse10 .cse5 .cse11 (= .cse0 .cse12)) (and .cse5 .cse30 .cse35) (and (= |ULTIMATE.start_main_~i~0#1| .cse39) (= |ULTIMATE.start_main_~z~0#1| .cse46) (= .cse0 (_ bv0 32))) (and .cse36 .cse23 .cse27 .cse30 .cse31 .cse35) (and .cse36 .cse23 .cse24 .cse25 .cse26 .cse27 .cse5 .cse30 (= |ULTIMATE.start_main_~z~0#1| .cse44) (= |ULTIMATE.start_main_~i~0#1| .cse45) .cse32) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~z~0#1| (_ bv0 32))) (and .cse36 .cse23 .cse26 .cse27 .cse5 (= |ULTIMATE.start_main_~i~0#1| .cse47) .cse31 (= |ULTIMATE.start_main_~z~0#1| .cse48)))))))))))))))) [2023-02-17 05:43:42,314 INFO L899 garLoopResultBuilder]: For program point L49-3(lines 49 52) no Hoare annotation was computed. [2023-02-17 05:43:42,317 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-02-17 05:43:42,322 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 05:43:42,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 05:43:42 BoogieIcfgContainer [2023-02-17 05:43:42,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 05:43:42,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 05:43:42,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 05:43:42,378 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 05:43:42,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 05:43:00" (3/4) ... [2023-02-17 05:43:42,381 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 05:43:42,387 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-02-17 05:43:42,388 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-02-17 05:43:42,388 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 05:43:42,388 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-17 05:43:42,429 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 05:43:42,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 05:43:42,429 INFO L158 Benchmark]: Toolchain (without parser) took 42618.10ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 42.1MB in the beginning and 47.6MB in the end (delta: -5.5MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2023-02-17 05:43:42,430 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 29.5MB in the beginning and 29.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:43:42,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.11ms. Allocated memory is still 71.3MB. Free memory was 41.8MB in the beginning and 30.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 05:43:42,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.11ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 51.2MB in the end (delta: -20.6MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2023-02-17 05:43:42,430 INFO L158 Benchmark]: Boogie Preprocessor took 36.75ms. Allocated memory is still 71.3MB. Free memory was 51.2MB in the beginning and 50.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 05:43:42,431 INFO L158 Benchmark]: RCFGBuilder took 294.58ms. Allocated memory is still 71.3MB. Free memory was 50.0MB in the beginning and 40.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 05:43:42,431 INFO L158 Benchmark]: TraceAbstraction took 41864.96ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 39.2MB in the beginning and 51.9MB in the end (delta: -12.7MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2023-02-17 05:43:42,431 INFO L158 Benchmark]: Witness Printer took 50.75ms. Allocated memory is still 113.2MB. Free memory was 51.9MB in the beginning and 47.6MB in the end (delta: 4.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 05:43:42,433 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 29.5MB in the beginning and 29.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.11ms. Allocated memory is still 71.3MB. Free memory was 41.8MB in the beginning and 30.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.11ms. Allocated memory is still 71.3MB. Free memory was 30.6MB in the beginning and 51.2MB in the end (delta: -20.6MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.75ms. Allocated memory is still 71.3MB. Free memory was 51.2MB in the beginning and 50.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 294.58ms. Allocated memory is still 71.3MB. Free memory was 50.0MB in the beginning and 40.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41864.96ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 39.2MB in the beginning and 51.9MB in the end (delta: -12.7MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * Witness Printer took 50.75ms. Allocated memory is still 113.2MB. Free memory was 51.9MB in the beginning and 47.6MB in the end (delta: 4.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.8s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 503 IncrementalHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 30 mSDtfsCounter, 503 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 38.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 25 NumberOfFragments, 8543 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 38.3s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 107 ConstructedInterpolants, 1 QuantifiedInterpolants, 22025 SizeOfPredicates, 14 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 120/404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((~bvadd128(i, 4294967295bv32) == ~bvadd128(1bv32, 2bv32) && z == ~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))) && i == ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))) || (((z == ~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))) && i == ~bvadd128(1bv32, 2bv32)) && ~bvult32(i, 16bv32)) && i == ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))) || (((((((z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))) && ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32)) && ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32)) && ~bvult32(~bvadd128(1bv32, i), 16bv32)) && ~bvult32(i, 16bv32)) && ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32)) && i == ~bvadd128(1bv32, 4bv32)) && i == ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))) || (((((z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(i, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(i, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(i, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(i, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(i, 4294967295bv32))))) && ~bvadd128(~bvadd128(i, 4294967295bv32), 4294967295bv32) == ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))) && ~bvult32(~bvadd128(1bv32, i), 16bv32)) && i == ~bvadd128(1bv32, 6bv32)) && ~bvult32(i, 16bv32)) && ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) || (((i == ~bvadd128(1bv32, 8bv32) && i == ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))) && ~bvult32(i, 16bv32))) || ((((((((((((~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32)) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, i), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && ~bvadd128(i, 4294967295bv32) == ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(i, 4294967295bv32)))))) && ~bvult32(i, 16bv32)) && (!~bvult32(i, 16bv32) || ~bvult32(~bvadd128(1bv32, i), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32))) && (~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))))))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))))), 16bv32))) && (~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))))))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))))))), 16bv32)))) || ((((((~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32)) && (!~bvult32(~bvadd128(1bv32, i), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && ~bvult32(i, 16bv32)) && (!~bvult32(i, 16bv32) || ~bvult32(~bvadd128(1bv32, i), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(13bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(13bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), ~bvadd128(1bv32, 13bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, 13bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))))))) || (~bvult32(i, 16bv32) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(13bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(13bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), ~bvadd128(1bv32, 13bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, 13bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))))))) || (((((~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32)) && (!~bvult32(~bvadd128(1bv32, i), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && ~bvult32(i, 16bv32)) && (!~bvult32(i, 16bv32) || ~bvult32(~bvadd128(1bv32, i), 16bv32))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(13bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(13bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), ~bvadd128(1bv32, 13bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, 13bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))))))) || (((((((((~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32)) && (~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(13bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(13bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), ~bvadd128(1bv32, 13bv32))))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))), 16bv32))) && ~bvult32(i, 16bv32)) && (!~bvult32(i, 16bv32) || ~bvult32(~bvadd128(1bv32, i), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32))) && i == ~bvadd128(1bv32, 13bv32))) || z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(13bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(13bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), ~bvadd128(1bv32, 13bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, 13bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))))))) || (((i == ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))) && ~bvult32(~bvadd128(i, 4294967295bv32), 16bv32)) && ~bvadd128(i, 4294967295bv32) == ~bvadd128(1bv32, 8bv32)) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))))) || (((((~bvadd128(~bvadd128(i, 4294967295bv32), 4294967295bv32) == 0bv32 && ~bvadd128(i, 4294967295bv32) == ~bvadd128(1bv32, 0bv32)) && ~bvult32(~bvadd128(1bv32, i), 16bv32)) && ~bvult32(i, 16bv32)) && z == ~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))) && i == ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))) || ((((i == ~bvadd128(1bv32, 7bv32) && ~bvult32(~bvadd128(1bv32, i), 16bv32)) && ~bvult32(i, 16bv32)) && ~bvadd128(i, 4294967295bv32) == ~bvadd128(1bv32, 6bv32)) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))))) || ((((!~bvult32(~bvadd128(1bv32, i), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32)) && ~bvult32(i, 16bv32)) && (!~bvult32(i, 16bv32) || ~bvult32(~bvadd128(1bv32, i), 16bv32))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(13bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(13bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), ~bvadd128(1bv32, 13bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, 13bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))))))) || ((((((((((~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32)) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, i), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(i, 4294967295bv32)))))) && ~bvult32(i, 16bv32)) && (!~bvult32(i, 16bv32) || ~bvult32(~bvadd128(1bv32, i), 16bv32))) && ~bvadd128(i, 4294967295bv32) == ~bvadd128(1bv32, 11bv32)) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32)))) || ((((((~bvadd128(i, 4294967295bv32) == ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))) && ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32)) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(i, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(i, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(i, 4294967295bv32)))))) && ~bvult32(~bvadd128(1bv32, i), 16bv32)) && ~bvult32(i, 16bv32)) && ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32)) && ~bvadd128(i, 4294967295bv32) == ~bvadd128(1bv32, 4bv32))) || ((~bvult32(i, 16bv32) && (!~bvult32(i, 16bv32) || ~bvult32(~bvadd128(1bv32, i), 16bv32))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(13bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(13bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), ~bvadd128(1bv32, 13bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, 13bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))))))) || ((i == ~bvadd128(1bv32, 0bv32) && z == ~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32))))) && ~bvadd128(i, 4294967295bv32) == 0bv32)) || ((((((~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32)) && (~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && (!~bvult32(~bvadd128(1bv32, i), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && (!~bvult32(i, 16bv32) || ~bvult32(~bvadd128(1bv32, i), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(13bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(13bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), ~bvadd128(1bv32, 13bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, 13bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))))))) || (((((((((((~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32)) && (~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, i), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && ~bvult32(i, 16bv32)) && (!~bvult32(i, 16bv32) || ~bvult32(~bvadd128(1bv32, i), 16bv32))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32))))) && i == ~bvadd128(1bv32, 11bv32)) && (~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))))))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))))), 16bv32)))) || (i == 0bv32 && z == 0bv32)) || ((((((((~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32)) && (~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || !~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))))), 16bv32))) && (!~bvult32(~bvadd128(1bv32, i), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, i)), 16bv32))) && ~bvult32(i, 16bv32)) && i == ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32))) && (!~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i))), 16bv32) || ~bvult32(~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, i)))), 16bv32))) && z == ~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(~bvor32(0bv32, ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 1bv32), 0bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 1bv32), ~bvadd128(1bv32, 0bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, 0bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32))))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 0bv32)))))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(~bvadd128(7bv32, 4294967295bv32), 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(7bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(7bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(7bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 128bv32), 7bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 128bv32), ~bvadd128(1bv32, 7bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, 7bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32))), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))), ~bvadd128(1bv32, ~bvadd128(1bv32, ~bvadd128(1bv32, 7bv32)))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(11bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(11bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(11bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 2048bv32), 11bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 2048bv32), ~bvadd128(1bv32, 11bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(13bv32, 4294967295bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(13bv32, 4294967295bv32))), ~bvadd128(1bv32, ~bvadd128(13bv32, 4294967295bv32))))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), 8192bv32), 13bv32), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), 8192bv32), ~bvadd128(1bv32, 13bv32)))), ~bvor32(~bvshl32(~bvand32(~zero_extendFrom16To32(x), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, 13bv32)), ~bvshl32(~bvand32(~zero_extendFrom16To32(y), ~bvshl32(1bv32, ~bvadd128(1bv32, 13bv32))), ~bvadd128(1bv32, ~bvadd128(1bv32, 13bv32)))))) RESULT: Ultimate proved your program to be correct! [2023-02-17 05:43:42,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE